diff options
author | Jack Sangdahl <[email protected]> | 2025-03-10 00:36:13 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-03-10 00:36:13 -0600 |
commit | 7c60dee83b436e8e8a667bf9f191beced8de4fc3 (patch) | |
tree | eb7a24ee2067f92245c57bb118e85a1baf15df50 /top_k_freq_element.cpp | |
parent | 5d7cdc215e4ba1ec4cbb24c084cccb5e5e641468 (diff) | |
download | leetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.tar.gz leetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.zip |
chore: move cpp and rust code to directory
Diffstat (limited to 'top_k_freq_element.cpp')
-rw-r--r-- | top_k_freq_element.cpp | 18 |
1 files changed, 0 insertions, 18 deletions
diff --git a/top_k_freq_element.cpp b/top_k_freq_element.cpp deleted file mode 100644 index 343595f..0000000 --- a/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; - } -}; |