Solution URL
https://leetcode.com/submissions/detail/413807223/
代码
class Solution {
public int missingNumber(int[] nums) {
//https://leetcode-cn.com/problems/missing-number/solution/que-shi-shu-zi-by-leetcode/
int missing = nums.length;
for(int i = 0; i < nums.length; i++){
missing ^= nums[i] ^ i;
}
return missing;
}
}