leetcode-136-singleNumber

#include <iostream>#include <vector>using namespace std;class Solution {public:    /*     用异或操作可以只保存出现奇数次的数字     */    int singleNumber(vector<int>& nums) {        int res = 0;        for (int i = 0; i < nums.size(); i++) {            res ^= nums[i];        }        return res;    }};