leetcode-二分-154. 寻找旋转排序数组中的最小值 II

class Solution {
public:
    int findMin(vector<int>& nums) {
        int l = 0;
        int r = nums.size()-1;
        while(l<=r){
            int mid = l + (r-l)/2;
            if(nums[mid]==nums[r])
                r--;
            else if(nums[mid]>nums[r])
                l =mid+1;
            else if(nums[mid]<nums[r])
                r = mid;

        }   
        return nums[l];
    }
};

标签：154,nums,int,mid,else,II,while,vector,leetcode
来源： https://www.cnblogs.com/ymec/p/15125469.html