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?
Example 1:
Input: [2,2,1] Output: 1
Example 2:
Input: [4,1,2,1,2] Output: 4
分析:
找出数组中只出现一次的数字,用异或2次会互相抵消的特性,当将数组里面的所有数异或一遍后,结果只会留下那个只出现1次的。
代码:
class Solution {
public:
int singleNumber(vector<int>& nums) {
int n=nums[0];
for(int i=1;i<nums.size();++i)
n=n^nums[i];
return n;
}
};