跳转至

只出现一次的数字 III⚓︎

Leetcode题目链接

描述⚓︎

详见中文题目链接。

解答⚓︎

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
class Solution {
public:
    vector<int> singleNumber(vector<int>& nums) {
        int s = 0;
        for (auto num : nums) s ^= num;

        int k = 0;
        while (!(s >> k & 1)) k++;

        int n1 = 0;
        for (auto num : nums) {
            if (num >> k & 1) n1 ^= num;
        }

        // If s == a ^ b, n1 == a, then s ^ n1 == a ^ b ^ a == b
        return vector<int>({n1, s ^ n1});
    }
};