class Solution {
class ComGreater {
public: bool operator()(const pair<int, int> &item1, const pair<int, int> &item2) {
return item1.second > item2.second;
}
};
public:
vector<int> topKFrequent(vector<int>& nums, int k) {
vector<int> result;
if(nums.size()==0||k==0)
return result;
map<int ,int> m;
for(auto it=nums.begin();it!=nums.end();it++)
{
m[*it]++;
}
vector<pair<int,int>> v(m.begin(),m.end());
sort(v.begin(),v.end(),ComGreater());
int i=0;
for(auto it=v.begin();i<k;it++,i++)
{
result.push_back(it->first);
}
return result;
}
};
347. Top K Frequent Elements
最新推荐文章于 2020-12-22 08:50:39 发布