[leetcode]136. 只出现一次的数字

我写的：

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

leetcode官方里的：https://leetcode-cn.com/problems/single-number/solution/zhi-chu-xian-yi-ci-de-shu-zi-by-leetcode/

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