Given an array of integers, every element appears three times except for one. Find that single one.
Note:
Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory?
方法一:用map存每个数字出现的次数,遍历map找出出现次数为1的那个返回
class Solution {
public:
int singleNumber(int A[], int n) {
// IMPORTANT: Please reset any member data you declared, as
// the same Solution instance will be reused for each test case.
map<int,int> m;
map<int,int>::iterator it;
for(int i=0; i<n; i++){
it = m.find(A[i]);
if(it == m.end())
m[A[i]] = 1;
else
m[A[i]] += 1;
}
for(it=m.begin(); it != m.end(); it++){
if(it->second == 1)
return it->first;
}
return 0;
}
};
方法二:用一个32位的数组记录对应位置上出现1的次数,出现3次的数字对应的1位的次数也为3的整数倍,那么只要遇到出现3次就把该位对应的出现次数置为0
最后剩下的这32位的值就是剩下的那个只出现一次的数了。
public class Solution {
public int singleNumber(int[] A) {
// Note: The Solution object is instantiated only once and is reused by each test case.
if(A.length == 0)
return 0;
int[] cnt = new int[32];
for(int i = 0; i < A.length; i++)
{
for(int j = 0; j < 32; j++)
{
if( (A[i]>>j & 1) ==1)
{
cnt[j] = (cnt[j] + 1)%3;
}
}
}
int res = 0;
for(int i = 0; i < 32; i++)
{
res += (cnt[i] << i);
}
cnt = null;
return res;
}
}