Single Number II
Given an array of integers, every element appears three times except for one. Find that single one.
Note:
Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory?
解题思路
class Solution {
public:
int singleNumber(vector<int>& nums) {
if (nums.size() == 0) return 0;
int n = nums.size();
int bitNum[32] = {0};
int ans = 0;
for (int i = 0; i < 32; ++i) {
for (int j = 0; j < n; ++j) {
if ((nums[j] >> i) & 1) {
bitNum[i]++;
}
}
ans |= ((bitNum[i] % 3) << i);
}
return ans;
}
};