347. Top K Frequent Elements（图解）

347. Top K Frequent Elements

Given a non-empty array of integers, return the k most frequent elements.

Example 1:

Input: nums = [1,1,1,2,2,3], k = 2
Output: [1,2]
Example 2:

Input: nums = [1], k = 1
Output: [1]

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.
It's guaranteed that the answer is unique, in other words the set of the top k frequent elements is unique.
You can return the answer in any order.

Solution

C++ Sol1

typedef pair<int, int> pii;

class Solution {
public:
    vector<int> topKFrequent(vector<int>& nums, int k) {
        unordered_map<int,int> m;
        for(int n: nums) {
            ++m[n];
        }
        
        priority_queue<pii, vector<pii>, greater<pii> > pq;
        for(auto it = m.begin(); it != m.end(); ++it) {
            pq.push(make_pair(it->second,it->first));
            if(pq.size() > k) pq.pop();
        }
        
        vector<int> res;
        while(pq.size() > 0) {
            res.push_back(pq.top().second);
            pq.pop();
        }
        return res;
    }
};

C++ Sol2

class Solution {
public:
    vector<int> topKFrequent(vector<int>& nums, int k) {
        unordered_map<int, int> counts;
        for(auto i : nums) ++counts[i];
        
        vector<vector<int>> buckets(nums.size() + 1);
        for(auto & k : counts) 
            buckets[k.second].push_back(k.first);
        reverse(begin(buckets), end(buckets));
        
        vector<int> res;
        for(auto & bucket: buckets) 
            for(auto i : bucket) {
                res.push_back(i);
                if(res.size() == k) return res;
            }
        
        return res;
    }
};

Explanation
方法一：最小堆
复杂度：$O(nlogk)$

方法二：桶排序
复杂度：$O(n)$