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?
public class Solution {
public int singleNumber(int[] A) {
int res=0;
int[]a=new int[32];
for(int i=0;i<32;i++){
for(int b:A){
int c=(b>>i)&1;
a[i]=a[i]+c;
}
res=res|(a[i]%3)<<i;
}
return res;
}
}