问题描述:
Given an 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?
AC代码如下:
int singleNumber(vector<int>& nums)
{
int ans = 0;
for(int i = 0;i < nums.size();i++)
{
ans = ans^nums[i];
}
return ans;
}