Given an array containing n distinct numbers taken from 0, 1, 2, …, n, find the one that is missing from the array.
For example,
Given nums = [0, 1, 3] return 2.
Note:
Your algorithm should run in linear runtime complexity. Could you implement it using only constant extra space complexity?
Credits:
Special thanks to @jianchao.li.fighter for adding this problem and creating all test cases.
Subscribe to see which companies asked this question
意思是找到从0到n没有出现的数,用位运算效率很高
class Solution {
public:
int missingNumber(vector<int>& nums) {
int diff = nums.size();
for(int i = 0; i < nums.size(); i++){
diff ^= nums[i];
diff ^= i;
}
return diff;
}
};