Update Find Minimum in Rotated Sorted Array - Leetcode 153.py

Author: gahogg

Find Minimum in Rotated Sorted Array - Leetcode 153/Find Minimum in Rotated Sorted Array - Leetcode 153.py

@@ -1,3 +1,16 @@
+# Brute Force Solution
+class Solution:
+    def findMin(self, nums: List[int]) -> int:
+        minn = float('inf')
+        for num in nums:
+            if num < minn:
+                minn = num
+        return minn
+
+# Time: O(n)
+# Space: O(1)
+
+# Optimal Solution
 class Solution:
     def findMin(self, nums: List[int]) -> int:
         n = len(nums)