时间复杂度(O( n)),思想,位运算
class Solution {
public:
int singleNumber(vector<int>& nums) {
vector<int> bits(64,0);
for(int i=0;i<nums.size();++i)
for(int j=0;j<bits.size();j++)
bits[j]+=(nums[i]&(0x01<<j))>>j;
int result = 0;
for(int j=bits.size()-1;j>=0;--j)
result = (result<<1)+bits[j]%3;
return result;
}
};