1.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?
solution:
class Solution {
public:
int singleNumber(vector<int>& nums) {
int result = 0;
for(int n:nums)
result ^= n;
return result;
}
};
ref:https://leetcode.com/discuss/6170/my-o-n-solution-using-xor
http://www.powerxing.com/leetcode-single-number/
太聪明了这个算法!!