136. Single Number
Easy
3087121FavoriteShare
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
Accepted
571,557
Submissions
920,468
class Solution {
public:
int singleNumber(vector<int>& nums) {
int res=0;
unordered_map<int,int> hash;
for(int val:nums){
hash[val]++;;
}
for(int val:nums){
if(hash[val]==1) res=val;
}
return res;
}
};
class Solution {
public:
int singleNumber(vector<int>& nums) {
int res=nums[0];
for(int val=1;val<nums.size();val++){
res=res^nums[val];
}
return res;
}
};