题目:
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
代码:
class Solution {
public:
int singleNumber(vector<int>& nums) {
if(nums.size() == 1)
return nums[0];
int target = 0;
for(int i = 0; i<nums.size(); i++)
target ^= nums[i];
return target;
}
};