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

#include <unordered_map>
#include <vector>
class Solution {
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param nums int整型vector 
     * @return int整型vector
     */
    vector<int> FindNumsAppearOnce(vector<int>& nums) {
        // write code here
        unordered_map<int, int> num_and_occur;
        for (auto& item : nums) {
            num_and_occur[item]++;
        }
        vector<int> res;
        for (auto& item : num_and_occur) {
            if (item.second == 1) {
                res.push_back(item.first);
            }
        }
        if (res[0] > res[1]) {
            auto tmp = res[1];
            res[1] = res[0];
            res[0] = tmp;
        }
        return res;
    }
};