面试题 53 - II. 0 ～ n-1 中缺失的数字

输入: [0,1,3]
输出: 2

输入: [0,1,2,3,4,5,6,7,9]
输出: 8

class Solution:
    def missingNumber(self, nums: List[int]) -> int:
        l, r = 0, len(nums) - 1
        if r == 0 or nums[0] == 1:
            return nums[0] ^ 1
        if nums[r] == r:
            return r + 1
        while r - l > 1:
            m = (l + r) >> 1
            if nums[m] == m:
                l = m
            else:
                r = m
        return nums[r] - 1

class Solution {
    public int missingNumber(int[] nums) {
        int l = 0, r = nums.length - 1;
        if (r == 0 || nums[0] == 1) {
            return nums[0] ^ 1;
        }
        if (nums[r] == r) {
            return r + 1;
        }
        while (r - l > 1) {
            int m = (l + r) >>> 1;
            if (nums[m] == m) {
                l = m;
            } else {
                r = m;
            }
        }
        return nums[r] - 1;
    }
}

/**
 * @param {number[]} nums
 * @return {number}
 */
var missingNumber = function (nums) {
  if (!nums || !nums.length) return 0;
  let left = 0;
  let right = nums.length - 1;
  while (left < right) {
    let mid = left + ~~((right - left) / 2);
    if (nums[mid] !== mid) {
      right = mid;
    } else {
      left = mid + 1;
    }
  }
  return nums[left] === left ? nums.length : left;
};