https://leetcode.com/problems/missing-number/
两解,1、求和;2、xor
解法一:求和
public class Solution {
public int missingNumber(int[] nums) {
int sum = 0;
int n = nums.length;
for (int i = 0; i < nums.length; i++) {
sum += nums[i];
}
return n * (n + 1) / 2 - sum;
}
}
解法二:xor
public class Solution {
public int missingNumber(int[] nums) {
int res = nums.length;
for (int i = 0; i < nums.length; i++) {
res = res ^ i ^ nums[i];
}
return res;
}
}