short and simple java 0ms


  • 1
    B

    public class Solution {
    public int findMin(int[] nums) {
    int l = 0;
    int r = nums.length - 1;

        while(l <= r - 1) {
            int mid = l + (r - l)/2;
            if(nums[mid] > nums[r])
                l = mid + 1;
            else 
                r = mid;
        }
        return nums[l];
    
    }
    

    }


Log in to reply
 

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