store/works/solutions/leetcode/cpp/260.cpp


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23

#include <vector>
#include <unordered_set>

using std::vector;

class Solution
{
public:
    vector<int> singleNumber(vector<int> &nums)
    {
        std::unordered_set<int> s;
        for (auto i : nums)
        {
            const auto result = s.find(i);
            if (result == s.cend())
                s.insert(i);
            else
                s.erase(result);
        }

        return vector<int>(s.cbegin(), s.cend());
    }
};