Easy & Simple Java Solution


  • 0
        public int findMin(int[] nums) {
            
            int l = 0, r = nums.length-1; 
    	    while (l < r) { 
    	    	
    			 int mid = (l + r) / 2;
    			 
    			 if (nums[mid] < nums[r]) r = mid; 
    				 
    			 else if (nums[mid] > nums[r]) l = mid + 1;
    				 
    			 else r--;  
    	    }
    	 return nums[l]; 
        }
    }
    

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.