1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
| class Solution {
public:
class myCmp{
public:
bool operator()(pair<int, int>& m, pair<int, int>& n){
return m.second > n.second;
}
};
vector<int> topKFrequent(vector<int>& nums, int k) {
unordered_map<int, int>map;
for(int i = 0; i < nums.size(); i++)map[nums[i]]++;
priority_queue<pair<int, int>, vector<pair<int, int>>, myCmp> pri_que;
for (unordered_map<int, int>::iterator it = map.begin(); it != map.end(); it++) {
pri_que.push(*it);
if (pri_que.size() > k)
pri_que.pop();
}
vector<int> result(k);
for (int i = k - 1; i >= 0; i--) {
result[i] = pri_que.top().first;
pri_que.pop();
}
return result;
}
};
|