LeetCode 260. Single Number III

描述

找出数组中只出现过一次的数

解决

用异或。

---

class Solution {public:    vector<int> singleNumber(vector<int>& nums) {        int t = 0;        for (auto& val : nums)        {            t ^= val;        }        int t1 = (t) & (~(t - 1));        int r1 = 0, r2 = 0;        for (auto& it : nums)        {            if (t1 & it)                r1 ^= it;            else                r2 ^= it;        }        return {r1, r2};    }};