lc153-Find Minimum in Rotated Sorted Array

發表於   |   分類於   |   0 comments   |  

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.

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
class Solution {
public:
    int findMin(vector<int>& nums) {
        int l = 0, r = nums.size()-1;
        while (l<r-1) {
            if (nums[l] < nums[r])  return nums[l];
            int mid = (l+r)/2;
            if (nums[mid]>nums[l] && nums[r]<nums[l]) 
                l = mid;
            else //if (nums[mid]>nums[l] && nums[r]<nums[l]) 
                r = mid;
        }
        return nums[l]<nums[r]?nums[l]:nums[r];
    }
};