leetcode

0 class Solution {

1 public:

2 int minDeletions(const string &s) {

3 int count[27] = {0};

4 for (const char c : s)

5 count[c & 0x1F]++;

6 sort(rbegin(count), rend(count));

7

8 int res = 0;

9 for (int i = 1; i <= 26 && count[i]; i++) {

10 const int diff = count[i] - count[i - 1] + 1;

11 if (diff >= 0) {

12 res += min(count[i], diff);

13 count[i] -= min(count[i], diff);

14 }

15 }

16 return res;

17 }

18 };