题解 | #数组中只出现一次的两个数字#

#include <unordered_map>
class Solution {
public:
    vector<int> FindNumsAppearOnce(vector<int>& nums) {
        unordered_map<int,int>m;
        vector<int>v;
        int n = nums.size();
        for(int i = 0;i<n;i++)
        {
            m[nums[i]]++;
        }
        for(int i = 0;i<n;i++)
        {
            if(m[nums[i]] == 1)
            {
                v.push_back(nums[i]);
            }
        }
        sort(v.begin(),v.end());
        return v;
    }
};