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?
思路一:利用Hash函数。将数组中的数作为Hash的键,如果出现就+1次,否则插入到Hash表中。随后遍历一次Hash表,找到值不是两次的那个即可。时间复杂度为O(N)。
class Solution {
public:
int singleNumber(int A[], int n)
{
unordered_map <int,int> mapping;
for(auto i=0;i<n;i++)
{
unordered_map<int,int>::iterator iter =mapping.find(A[i]);
if(iter!=mapping.end())
{
mapping[A[i]]++;
}
else
mapping[A[i]]=1;
}
int result;
for(unordered_map<int,int>::iterator iter=mapping.begin();iter!=mapping.end();iter++)
if(iter->second!=2)
{
result=iter->first;
break;
}
return result;
}
};
思路二:思路一可行,但是空间复杂度过高,不符合题意。联系到元素只出现两次这个条件,考虑使用位运算。
class Solution {
public:
int singleNumber(int A[], int n) {
int x = 0;
for (size_t i = 0; i < n; ++i)
x ^= A[i];
return x;
}
};
思路三:使用accumulate函数。
class Solution {
public:
int singleNumber(int A[], int n) {
return accumulate(A, A + n, 0, bit_xor<int>());
}
};
关于函数accumulate可以参考 http://www.cplusplus.com/reference/numeric/accumulate/