leetcode 136. 只出现一次的数字(位运算)

异或位运算

class Solution {
public:
    int singleNumber(vector<int>& nums) {
        return accumulate(nums.begin(),nums.end(),0,bit_xor());
    }
};

class Solution {
public:
    int singleNumber(vector<int>& nums) {
        int res = 0;
        for (auto& x: nums) {
            res = res ^ x;
        }
        return res;
    }
};