Leetcode--Java--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.

Follow up: Could you implement a solution using only O(1) extra space complexity and O(n) runtime complexity?

样例描述

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.
Example 4:

Input: nums = [0]
Output: 1
Explanation: n = 1 since there is 1 number, so all numbers are in the range [0,1]. 1 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. 思路一：数学技巧 ，利用n个连续的数总和是 n * ( n + 1) / 2，减去出现的数剩下的就是没有出现的
2. 思路二：位运算，将0到n这n+1个数求异或运算，然后在逐个和出现的数异或，由于异或相同为0，而0与任何数异或等于任何数，则最后结果就是缺失的数

代码

思路一：

class Solution {
    public int missingNumber(int[] nums) {
      int n = nums.length;
      //注意其实是n+1个项，首项是0，末项是n+1
      int res = n * (n + 1) / 2;
      //减去所有出现过的，剩余就是消失的数
      for (int x: nums) res -= x;
      return res;
    }
}

思路二：

class Solution {
    public int missingNumber(int[] nums) {
      //由于循环里面 n对应的下标超过了数组的范围，先将n放到结果里面
     int missNum = nums.length;
     for (int i = 0; i < nums.length; i ++){
         missNum ^= i ^ nums[i];
     }
     return missNum;
    }
}