class Solution {
public:
int missingNumber(vector<int>& nums) {
int x = 0;
int n = nums.size();
for(int i = 0; i < n; ++i){ //x ^ x = 0, x ^ 0 = x
x ^= nums[i];
}
for(int i = 0; i <= n; ++i){
x ^= i;
}
return x;
}
};
LeetCode 268. 丢失的数字
最新推荐文章于 2024-09-28 22:05:59 发布