问题描述:
Given a non-empty array of integers, return the k most frequent elements.
For example,
Given [1,1,1,2,2,3] and k = 2, return [1,2].
用到的工具是priority_queue<pair<int, int>> pq;
pop()出的是最小值
程序如下:
#include<iostream>
#include<vector>
#include<stack>
#include<queue>
#include<utility>
#include<unordered_map>
using namespace std;
class Solution {
public:
vector<int> topKFrequent(vector<int>& nums, int k) {
unordered_map<int, int> map;
for (int num : nums) {
map[num]++;
}
vector<int> res;
// pair<first, second>: first is frequency, second is number
priority_queue<pair<int, int>> pq;
for (auto it = map.begin(); it != map.end(); it++) {
pq.push(make_pair(it->second, it->first));
if (pq.size() > (int)map.size() - k) {
res.push_back(pq.top().second);
pq.pop();
}
}
return res;
}
};
void main()
{
Solution s;
vector<int> nums = { 1,2,2,4,4,5};
vector<int> res = s.topKFrequent(nums, 2);
for (int i = 0;i < res.size();i++)
cout << res[i] << endl;
}