剑指offer位运算56 - II. 数组中数字出现的次数 II

Posted 2021-02-27 trevo

位运算 + 状态转移

class Solution {
public:
    int singleNumber(vector<int>& nums) {
        int once, twice = 0;
        for(int i = 0; i < nums.size(); i++)
        {
            once = once ^ nums[i] & ~twice;
            twice = twice ^ nums[i] & ~once;
        }
        return once;
    }
};