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

Posted 2020-11-29 trevo

题目链接：https://leetcode-cn.com/problems/shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof/

位运算

class Solution {
public:
    vector<int> singleNumbers(vector<int>& nums) {
        int s = 0;
        for(int num : nums)
            s ^= num;
        int k = s & (-s);
        vector<int> rs(2, 0);
        for(int num : nums)
        {
            if(num & k) rs[0] ^= num;
            else rs[1] ^= num;
        }
        return rs;
    }
};