aboutsummaryrefslogtreecommitdiff
path: root/other/top_k_freq_element.cpp
diff options
context:
space:
mode:
authorJack Sangdahl <[email protected]>2025-06-27 12:23:02 -0600
committerJack Sangdahl <[email protected]>2025-06-27 12:23:02 -0600
commita96b65cbfad7f62f3db6b2eab105e4e25c0414c5 (patch)
treee2a2b3f49f9fb741be81415266ac93e74cff42ec /other/top_k_freq_element.cpp
parent694ad5ed71edcb1deccab54b72d706b779918276 (diff)
downloadleetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz
leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/top_k_freq_element.cpp')
-rw-r--r--other/top_k_freq_element.cpp18
1 files changed, 0 insertions, 18 deletions
diff --git a/other/top_k_freq_element.cpp b/other/top_k_freq_element.cpp
deleted file mode 100644
index 343595f..0000000
--- a/other/top_k_freq_element.cpp
+++ /dev/null
@@ -1,18 +0,0 @@
-#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() > um.size() - k)
- ans.push_back(pqp.top().second), pqp.pop();
- }
- return ans;
- }
-};