153. Find Minimum in Rotated Sorted Array.cpp

class Solution {
public:
    int findMin(vector<int>& nums) {
         if(nums.size()==1) return nums[0];
        
        for(int i=0;i<nums.size()-1;i++){
            if(nums[i]<=nums[i+1]) continue;
            if(nums[i]>nums[i+1]) return nums[i+1];
        }
        // 1 2 3 3
        return nums[0];
    }
};