154-Find-Minimum-in-Rotated-Sorted-Array-II https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii/
class Solution(object):
def findMin(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
start = 0
end = len(nums) - 1
while start < end and nums[start] >= nums[end]:
mid = (start + end) / 2
if nums[mid] < nums[end]:
end = mid
elif nums[start] < nums[mid]:
start = mid + 1
else:
return min(self.findMin(nums[:mid+1]), self.findMin(nums[mid+1:]))
return nums[start]
Follow up for "Find Minimum in Rotated Sorted Array":
What if duplicates are allowed?
Would this affect the run-time complexity? How and why?
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.
The array may contain duplicates.