LeetCode 154. Find Minimum in Rotated Sorted Array II

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