[leetcode] 137. Single Number II

Description

Given a non-empty array of integers, every element appears three times except for one, which appears exactly once. Find that single one.
Note:

Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory?

Example 1:
Input: [2,2,3,2]
Output: 3

Example 2:
Input: [0,1,0,1,0,1,99]
Output: 99

Analysis

说明：每个int数字都是由32位二进制数组成的。对每个int数字的所有32位0、1进行对应累加得到bits[32]，然后将bits的每一位对3取余，余数组成的32位数字即是只出现1次的int数字。
例如：(2,2,3,2)，将其写成32为二进制数为：
0,0,0,…,0,0,1,0;
0,0,0,…,0,0,1,0;
0,0,0,…,0,0,1,1;
0,0,0,…,0,0,1,0.
然后将这4个int数字的对应位累加并对3取余，得到bits[32]为：
0,0,0,…,0,0,1,1.
它对应的10进制数为3.因此只出现一次的数字为3.

Code

class Solution {
public:
    int singleNumber(vector<int>& nums) {
        int bits[32]={0};
        int n = nums.size();
        int res = 0;
        
        for(int i=0; i<32; i++){
            for(int j=0; j<n; j++){
                bits[i] += (nums[j]>>i)&1;
            }
            res = res| (bits[i]%3<<i);
        }
        
        return res;
    }
};