Given an array contains N numbers of 0 .. N, find which number doesn't exist in the array.
Example
Given N = 3
and the array [0, 1, 3]
, return 2
.
第一种:
public class Solution {
/**
* @param nums: an array of integers
* @return: an integer
*/
public int findMissing(int[] nums) {
int sum = 0, numSum = 0;
for(int i = 0; i < nums.length; i++) {
numSum += nums[i];
sum += i;
}
return sum + nums.length - numSum;
}
}
public class Solution {
/**
* @param nums: an array of integers
* @return: an integer
*/
public int findMissing(int[] nums) {
int sum = 0;
for(int i = 0; i < nums.length; i++) {
sum ^= nums[i];
sum ^= i;
}
return sum ^ nums.length;
}
}