class Solution {
public:
vector<int> singleNumber(vector<int>& nums) {
unordered_map<int, int> hs;
for (int num : nums) {
hs[num]++;
}
vector<int> res;
for (const auto& [num, occ] : hs) {
if (occ == 1) {
res.push_back(num);
}
}
return res;
}
};
LeetCode #260 只出现一次的数字 III
最新推荐文章于 2024-07-25 19:34:38 发布