leetcode

0 class Solution {

1 public:

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

3 int mask1 = 0, mask2 = 0;

4 for (int n : nums) {

5 mask1 = (mask1 ^ n) & ~mask2;

6 mask2 = (mask2 ^ n) & ~mask1;

7 }

8 return mask1;

9 }

10 };