[leetcode]Find Minimum in Rotated Sorted Array

Find Minimum in Rotated Sorted Array

 

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.

class Solution {
public:
    /*
        1、 /\     2、\/    3、 /      4、\
    */
    int findMin(vector<int>& nums) {
        int mid;
        int left = 0;
        int right = nums.size() - 1;
        
        while(left < right){
            mid = left + (right - left) / 2;
            if(nums[mid] > nums[right]){ //  1、/\  2、/
                left = mid + 1;
            }else{
                //正好位于拐点 3、\/ 4、\  -
                if(nums[mid] < nums[mid - 1]){
                    return nums[mid];
                }
                right = mid - 1;
            }
        }
        
        return nums[left];
    }
};