LeetCode 137. Single Number II

描述

找出数组中给出的只出现了一次的数

解决

---

class Solution {public:    int singleNumber(vector<int>& nums) {        int one = 0, two = 0, three = 0;        for (auto it : nums)        {            //求出现两次的bit位            two |= (one & it);            //出现一次的bit位            one ^= it;            //printf("%x\n", one);            //printf("%x\n", two);            //若出现了三次，则把这些bit置为0，求出哪些为需要置为0            three = ~(one & two);            //出现了三次的bit都要置为0            one &= three;            two &= three;        }        return one;    }};