原链接:https://leetcode-cn.com/problems/missing-number-lcci/
异或解决(学到了)
int missingNumber(int* nums, int numsSize){
int res = numsSize;
for(int i=0;i<numsSize;i++){
res ^= i;
res ^= nums[i];
}
return res;
}
原链接:https://leetcode-cn.com/problems/missing-number-lcci/
异或解决(学到了)
int missingNumber(int* nums, int numsSize){
int res = numsSize;
for(int i=0;i<numsSize;i++){
res ^= i;
res ^= nums[i];
}
return res;
}