diff options
author | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
commit | a96b65cbfad7f62f3db6b2eab105e4e25c0414c5 (patch) | |
tree | e2a2b3f49f9fb741be81415266ac93e74cff42ec /other/top_k_freq_words.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/top_k_freq_words.cpp')
-rw-r--r-- | other/top_k_freq_words.cpp | 29 |
1 files changed, 0 insertions, 29 deletions
diff --git a/other/top_k_freq_words.cpp b/other/top_k_freq_words.cpp deleted file mode 100644 index eaf31d5..0000000 --- a/other/top_k_freq_words.cpp +++ /dev/null @@ -1,29 +0,0 @@ -#include "leetcode.h" - -struct Compare { - bool operator()(pair<int, string> a, pair<int, string> b) { - if (a.first == b.first) - return a.second > b.second; - else - return a.first < b.first; - } -}; - -class Solution { -public: - vector<string> topKFrequent(vector<string> &words, int k) { - unordered_map<string, int> um; - for (int i = 0; i < words.size(); i++) - um[words[i]]++; - priority_queue<pair<int, string>, vector<pair<int, string>>, Compare> - pqpvpc; - for (auto i : um) - pqpvpc.push({i.second, i.first}); - vector<string> ans; - while (k--) { - ans.push_back(pqpvpc.top().second); - pqpvpc.pop(); - } - return ans; - } -}; |