问题
思路
位运算,利用xor的性质即可。a^a = 0(additive inverse)
代码
class Solution {
public:
int singleNumber(vector<int>& nums) {
int sz = nums.size();
if(!sz) return 0;
int ret = nums[i];
for( int i = 1; i < sz; ++i )
{
ret ^= nums[i];
}
return ret;
}
};