问题描述:
Given a non-empty array of integers, return the k most frequent elements.
示例:
Given [1,1,1,2,2,3]
and k = 2, return [1,2]
.
Note:
- You may assume k is always valid, 1 ? k ? number of unique elements.
- Your algorithm's time complexity must be better than O(n log n), where n is the array's size.
问题分析:
利用hash表记录每个元素出现的个数,再利用优先队列求出前k个出现次数最多的元素。
过程详见代码:
class Solution {
public:
vector<int> topKFrequent(vector<int>& nums, int k) {
unordered_map<int, int> m;
vector<int> res;
struct cmp{
bool operator ()(pair<int, int>& a, pair<int, int>& b){
return a.second < b.second;//最da值优先
}
};
priority_queue <pair<int, int>, vector<pair<int, int>>,cmp> ans;
for (auto num : nums)
{
m[num]++;
}
for (auto it : m)
{
ans.emplace(pair<int, int>(it.first, it.second));
}
for (int i = 0; i < k; i++)
{
auto p = ans.top();
res.emplace_back(p.first);
ans.pop();
}
return res;
}
};