class Solution { public: void FindNumsAppearOnce(vector<int> data,int* num1,int *num2) { vector<int> res; map<int, int> m; for(auto x:data) m[x]++; for(auto x:m){ if(x.second == 1) res.push_back(x.first); } *num1=res[0], *num2=res[1]; } };
遍历时,key可以用m.first调用,value可以用m.second调用
原文:https://www.cnblogs.com/syw-home/p/13594152.html