1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
| class Solution {
public int singleNumber(int[] nums) {
int res = 0;
for (int offset = 0; offset < Integer.SIZE; offset++) {
int mask = 1 << offset;
int times = 0;
for (int num : nums) {
if ((num & mask) != 0) {
times++;
}
}
if (times % 3 != 0) {
res |= mask;
}
}
return res;
}
}
|
References
137. Single Number II
剑指 Offer II 004. 只出现一次的数字