Why can I compare nums[mid] to last element instead of nums[r] to get the correct answer?


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

Log in to reply
 

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