154. Find Minimum in Rotated Sorted Array II

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