剑指 Offer 56 - II. 数组中数字出现的次数 II
class Solution {
public:
int singleNumber(vector<int>& nums) {
int ans = 0, bit = 1;
for(int ii = 0; ii < 31; ii++) {
int cnt = 0;
for(auto num : nums) if(bit & num) cnt++;
if(cnt % 3) ans |= bit;
bit <<= 1;
}
return ans;
}
};