aboutsummaryrefslogtreecommitdiff
path: root/top_k_freq_element.cpp
diff options
context:
space:
mode:
authorjack <[email protected]>2024-06-14 13:13:15 -0600
committerjack <[email protected]>2024-06-14 13:13:15 -0600
commitd343a3b18dbaca9297d4f7b2280c4a16f0a5c8aa (patch)
tree96df922dae2a5073d9a50ea70c7aae6aa37e3ebe /top_k_freq_element.cpp
downloadleetcode-d343a3b18dbaca9297d4f7b2280c4a16f0a5c8aa.tar.gz
leetcode-d343a3b18dbaca9297d4f7b2280c4a16f0a5c8aa.zip
initial
Diffstat (limited to 'top_k_freq_element.cpp')
-rw-r--r--top_k_freq_element.cpp18
1 files changed, 18 insertions, 0 deletions
diff --git a/top_k_freq_element.cpp b/top_k_freq_element.cpp
new file mode 100644
index 0000000..86d7cb4
--- /dev/null
+++ b/top_k_freq_element.cpp
@@ -0,0 +1,18 @@
+#include "leetcode.h"
+
+class Solution {
+public:
+ vector<int> topKFrequent(vector<int> &nums, int k) {
+ unordered_map<int, int> um;
+ for (int n : nums)
+ um[n]++;
+ vector<int> ans;
+ priority_queue<pair<int, int>> pqp;
+ for (auto it = um.begin(); it != um.end(); it++) {
+ pqp.push(make_pair(it->second, it->first));
+ if (pqp.size() > (int)um.size() - k)
+ ans.push_back(pqp.top().second), pqp.pop();
+ }
+ return ans;
+ }
+};