public class Solution {
public int singleNumber(int[] A) {
int[] bits = new int[32];
int result = 0;
for (int i=0; i<bits.length; i++){
for (int j=0; j<A.length; j++){
bits[i] += A[j]>>i&1;
bits[i] %= 2;
}
result |= (bits[i]<<i);
}
return result;
}
}
Single Number
最新推荐文章于 2018-01-18 20:54:52 发布