Binary rotation array (2)

A daily topic ing, Today is a day hard topic 154. Find Minimum in Rotated Sorted Array II

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