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后,再次体会到位运算的强大,对每一个元素进行异或,相同的元素可以为0,最后剩下的元素就是出现过一次的元素。
class Solution {
public:
int singleNumber(vector<int>& nums) {
sort(nums.begin(),nums.end());
for(int i=0;i<nums.size();i+=2){
if(nums[i]!=nums[i+1]){
return nums[i];
}
}
return nums[nums.size()-1];
}
};
class Solution{
public:
int singleNumber(vector<int>& nums) {
int ans=0;
for(int i=0;i<nums.size();i++){
ans^=nums[i];
}
return ans;
}
};