leetcode

Solution to some Leetcode problems written in C++

git clone git://git.dimitrijedobrota.com/leetcode.git

1781.cpp (635B)

0 class Solution { 1 public: 2 int beautySum(const string &s) { 3 int res = 0; 4 for (auto i = 0; i < s.size(); i++) { 5 int cnt[27] = {0}, maxi = 0, mini = 0; 6 for (auto j = i; j < s.size(); j++) { 7 const int idx = s[j] & 0x1F; 8 maxi = max(maxi, ++cnt[idx]); 9 if (mini >= cnt[idx] - 1) { 10 mini = cnt[idx]; 11 for (int k = 1; k <= 26; ++k) 12 mini = min(mini, cnt[k] == 0 ? INT_MAX : cnt[k]); 13 } 14 res += maxi - mini; 15 } 16 } 17 return res; 18 } 19 };