137. Single Number II 发表于 2022-01-21 1234567891011121314151617181920class 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; }} Reference137. Single Number II剑指 Offer II 004. 只出现一次的数字