154.find-minimum-in-rotated-sorted-array-ii.cpp

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