153. Find Minimum in Rotated Sorted Array
Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.
(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).
Find the minimum element.
You may assume no duplicate exists in the array.
Solution: Binary Search
class Solution(object):
def findMin(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
def binary_search(low, high):
if low >= high:
return nums[low]
mid = low + (high - low) / 2
if nums[mid] > nums[high]:
return binary_search(mid + 1, high)
return binary_search(low, mid)
return binary_search(0, len(nums) - 1)