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/sort_char_freq.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/sort_char_freq.cpp')
-rw-r--r-- | other/sort_char_freq.cpp | 26 |
1 files changed, 0 insertions, 26 deletions
diff --git a/other/sort_char_freq.cpp b/other/sort_char_freq.cpp deleted file mode 100644 index ea7d8af..0000000 --- a/other/sort_char_freq.cpp +++ /dev/null @@ -1,26 +0,0 @@ -#include "leetcode.h" - -class Solution { -public: - string frequencySort(string s) { - unordered_map<char, int> freq; - for (auto a : s) - freq[a]++; - priority_queue<pair<int, char>> pqp; - for (auto [a, f] : freq) - pqp.push({f, a}); - string ans; - pair<int, char> curr; - while (!pqp.empty()) { - curr = pqp.top(); - pqp.pop(); - ans += string(curr.first, curr.second); - } - return ans; - } -}; - -int main() { - Solution obj; - cout << obj.frequencySort("tree"); -} |