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/min_deletions_unique_char.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/min_deletions_unique_char.cpp')
-rw-r--r-- | other/min_deletions_unique_char.cpp | 28 |
1 files changed, 0 insertions, 28 deletions
diff --git a/other/min_deletions_unique_char.cpp b/other/min_deletions_unique_char.cpp deleted file mode 100644 index c971b21..0000000 --- a/other/min_deletions_unique_char.cpp +++ /dev/null @@ -1,28 +0,0 @@ -#include "leetcode.h" - -class Solution { -public: - int minDeletions(string s) { - vector<int> freq(26, 0); - int ans = 0; - for (char c : s) - freq[c - 'a']++; - sort(freq.begin(), freq.end()); - for (int i = 24; i >= 0; i--) { - if (freq[i] == 0) - break; - if (freq[i] >= freq[i + 1]) { - int prev = freq[i]; - freq[i] = max(0, freq[i + 1] - 1); - ans += prev - freq[i]; - } - } - return ans; - } -}; - -int main() { - Solution obj; - string s = "aab"; - cout << obj.minDeletions(s); -} |