leetcode

0 class Solution {

1 public:

2 vector<int> singleNumber(const vector<int> &nums) {

3 long long diff = accumulate(begin(nums), end(nums), 0, bit_xor<int>());

4 diff &= -diff;

5 vector<int> res = {0, 0};

6 for (const int n : nums)

7 res[(n & diff) == 0] ^= n;

8 return res;

9 }

10 };