Suppose a sorted array 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.
Difficulty:Medium
class Solution(object):
def findMin(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
leng = len(nums)
if leng == 1:
return nums[0]
start = 0
end = leng - 1
if nums[0]<=nums[leng-1]:
return nums[0]
while end>=start:
if end==start:
return nums[end]
if end-start==1:
if(nums[end]>=nums[start]):
return nums[start]
else:
return nums[end]
mid = start + (end-start)/2
if nums[mid]<=nums[start]:
end = mid
else:
start = mid