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

原创于 2016-08-12 17:29:03 发布 · 359 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #cpp

C++ 同时被 3 个专栏收录

299 篇文章

订阅专栏

Leetcode C++

287 篇文章

订阅专栏

Leetcode Hash Table

35 篇文章

订阅专栏

本文介绍了一种解决LeetCode 347题Top K Frequent Elements的方法，该方法使用哈希表和优先队列来找出数组中出现频率最高的k个元素。确保了算法的时间复杂度优于O(nlogn)。

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;
    }
};