LeetCode 137. 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?

题目链接：https://leetcode.com/problems/single-number-ii/

题目分析：计算每位1的个数的和模3，不为0则表示出现1次的数的当前位为1，否则为0

public class Solution {
    public int singleNumber(int[] nums) {
        int n = nums.length, ans = 0;
        for (int i = 0; i < 32; i ++) {
            int cnt1 = 0;
            for (int j = 0; j < n; j ++) {
                if ((nums[j] & (1 << i)) != 0) {
                    cnt1 ++;
                }
            }
            if ((cnt1 % 3) != 0) {
                ans |= (1 << i);
            }
        }
        return ans;
    }
}