Update 153._find_minimum_in_rotated_sorted_array.md

Author: 0xkookoo

docs/Leetcode_Solutions/Python/153._find_minimum_in_rotated_sorted_array.md

@@ -56,3 +56,32 @@ class Solution(object):
             pivot = nums[i]
         return nums[0]
 ```
+
+
+> 思路 2
+******- 时间复杂度: O(lgN)******- 空间复杂度: O(1)******
+
+
+二分法，思路看代码一目了然，[leetcode第33题](https://github.com/apachecn/awesome-algorithm/blob/master/docs/Leetcode_Solutions/Python/033._search_in_rotated_sorted_array.md)这道题很类似，我画了图的，可以看看
+
+beats 100%
+
+```python
+class Solution(object):
+    def findMin(self, nums):
+        """
+        :type nums: List[int]
+        :rtype: int
+        """
+        l, r = 0, len(nums) - 1
+        while l <= r:
+            mid = l + ((r-l) >> 1)
+            if nums[mid] < nums[mid-1]:
+                return nums[mid]
+            elif nums[mid] < nums[l]:
+                r = mid - 1
+            elif nums[mid] > nums[r]:
+                l = mid + 1
+            else:
+                return nums[l]
+```