class Solution {
public:
int singleNumber(vector<int>& nums) {
int dig[32] = {0};
for(auto i : nums){
for(int j = 0; j < 32; j++) {
dig[j] += i&0x01;
i = i >> 1;
if(dig[j]%3==0) dig[j] = 0;
}
}
int res = 0;
for(int i = 0; i < 32; i++){
res += (dig[i]<<i);
}
return res;
}
};
Single Number II
最新推荐文章于 2022-07-02 13:41:47 发布