LeetCode 136.只出现一次的数字

#include <iostream>
#include <cstring>
#include <string>
#include <algorithm>
#include <vector>
using namespace std;

/*
* 思路：每个数和自己做异或运算结果都是0，则将整个数组进行异或运算，两两消除
* 异或的最终结果就是只出现了一次的数字
*/

class Solution {
public:
    int singleNumber(vector<int>& nums) {
        int n = nums.size(), res = 0;
        for (int i = 0; i < n; i++)
        {
            res ^= nums[i];
        }
        return res;
    }
};


int main()
{
    vector<int>nums;
    int n, a;
    cin >> n;
    for (int i = 0; i < n; i++)
    {
        cin >> a;
        nums.push_back(a);
    }
    Solution A;
    cout << A.singleNumber(nums) << endl;
}