LeetCode 268. Missing Number

Given an array nums containing n distinct numbers in the range [0, n], return the only number in the range that is missing from the array.

Example 1:

Input: nums = [3,0,1]
Output: 2
Explanation: n = 3 since there are 3 numbers, so all numbers are in the range [0,3]. 2 is the missing number in the range since it does not appear in nums.

Example 2:

Input: nums = [0,1]
Output: 2
Explanation: n = 2 since there are 2 numbers, so all numbers are in the range [0,2]. 2 is the missing number in the range since it does not appear in nums.

Example 3:

Input: nums = [9,6,4,2,3,5,7,0,1]
Output: 8
Explanation: n = 9 since there are 9 numbers, so all numbers are in the range [0,9]. 8 is the missing number in the range since it does not appear in nums.

Constraints:

• n == nums.length
• 1 <= n <= 104
• 0 <= nums[i] <= n
• All the numbers of nums are unique.

---

两种方法：

1. 自己只想到了计算总和然后相减，甚至忘了可以直接等差数列求和，还写了个for求和……懒得改了就这样吧。

Runtime: 1 ms, faster than 87.15% of Java online submissions for Missing Number.

Memory Usage: 51.4 MB, less than 30.07% of Java online submissions for Missing Number.

class Solution {
    public int missingNumber(int[] nums) {
        int n = nums.length + 1;
        int total = 0;
        for (int i = 0; i < n; i++) {
            total += i;
        }
        int numsSum = 0;
        for (int num : nums) {
            numsSum += num;
        }
        return total - numsSum;
    }
}

2. 位运算。因为自己和自己xor得0，所以a xor a xor b = b，所以如果把所有数字和所有index一起xor，最后出来的结果就是missing number。注意就是最后还要xor一下数组长度，因为一共有length这么多的元素。

Runtime: 1 ms, faster than 87.15% of Java online submissions for Missing Number.

Memory Usage: 51.2 MB, less than 36.54% of Java online submissions for Missing Number.

class Solution {
    public int missingNumber(int[] nums) {
        int result = 0;
        for (int i = 0; i < nums.length; i++) {
            result ^= (nums[i] ^ i);
        }
        return result ^ nums.length;
    }
}