153 Find Minimum in Rotated Sorted Array
Last updated
Was this helpful?
Last updated
Was this helpful?
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 become4 5 6 7 0 1 2
).
Find the minimum element.
You may assume no duplicate exists in the array.
(1) Binary Search
思路:用二分查找,每次取中点,比较nums[mid] 和 nums[end]的大小关系,如果nums[mid] > nums[end], 说明最小值一定在[mid + 1, end]之间,否则最小值在[start, mid - 1]之间
时间复杂度O(logn), 空间复杂度O(1)