题目:
Given a non-empty array of integers, every element appears twice except for one. Find that single one.
Note:
Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory?
方法:
异或,两个相同的数的异或是0,剩下的就是只出现一次的数了.
int singleNumber(vector<int>& nums)
{
int len=nums.size();
int ans=nums[0];
for(int i=1;i<len;i++)
{
ans=ans^nums[i];
}
return ans;
}
{
int len=nums.size();
int ans=nums[0];
for(int i=1;i<len;i++)
{
ans=ans^nums[i];
}
return ans;
}