136. Single Number
Given a non-empty array of integers, every element appears twice except for one. Find that single one.
Example 1:
Input: [2,2,1]
Output: 1
Example 2:
Input: [4,1,2,1,2]
Output: 4
Solution
C++
class Solution {
public:
int singleNumber(vector<int>& nums) {
int res = 0;
for(int n: nums) {
res ^= n;
}
return res;
}
};
Explanation