public int singleNumber(int[] A)
{
int bitsNum = 32;
int [][] bits = new int[bitsNum][2];
for(int i = 0; i < A.length; i++)
{
for(int j = 0; j < bitsNum; j++)
{
bits[j][((A[i]&(1<<j))!=0 ? 1:0)]++;
}
}
int v = 0;
for(int i = 0; i < bitsNum; i++)
{
v = v | (( ((bits[i][0] % 3)==1)? 0:1 ) << i);
}
return v;
}
[leetcode] Single Number II
最新推荐文章于 2018-06-24 04:59:58 发布