Day-25 Find Minimum in Rotated Sorted Array II

class Solution {
    public int findMin(int[] nums) {
        int left=0;
        int right=nums.length-1;
        
        while(left<right){
        
            int mid = left + (right - left)/2;
            
            if(nums[right]>nums[mid]){
                right=mid;
            }
            else if(nums[right]==nums[mid]){
                right--;
            }
            else{
                left=mid+1;
            }
        }
        
        return nums[left];
    }
}