Leetcode 347. Top K Frequent Elements (Medium) (cpp)

Leetcode 347. Top K Frequent Elements (Medium) (cpp)

Tag: Hash Table, Heap

Difficulty: Medium

/*

347. Top K Frequent Elements (Medium)

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].

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

*/
class Solution {
public:
    vector<int> topKFrequent(vector<int>& nums, int k) {
        vector<int> res;
        unordered_map<int, int> mapping;
        for (auto i : nums) { 
            mapping[i]++;
        }
        priority_queue<pair<int, int>> q;
        for (auto i = mapping.begin(); i != mapping.end(); i++) {
            q.push(make_pair(i -> second, i -> first));
            if (q.size() > (int)mapp.size() - k) {
                res.push_back(q.top().second);
                q.pop();
            }
        }
        return res;
    }
};