原文地址:http://blog.csdn.net/magisu/article/details/13169283
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?
我:现在自己都不能写出代码了吗。。。
class Solution {
public:
int singleNumber(vector<int>& nums) {
int a=0;
int len=nums.size();
for(int i=0;i<len;i++)
{
a=a^nums[i];
}
return a;
}
};