1
class Solution {
2
 public:
3
  int beautySum(string s) {
4
    int n = s.length(), sum = 0;
5
    for (int i = 0; i < n - 1; i++) {
6
      vector<int> dp(26, 0);
7
      dp[s[i] - 'a']++;
8
      for (int j = i + 1; j < n; j++) {
9
        dp[s[j] - 'a']++;
10
        int minNum = INT_MAX, maxNum = INT_MIN;
11
        for (int k = 0; k < 26; k++) {
12
          if (dp[k]) minNum = min(minNum, dp[k]);
13
          if (dp[k]) maxNum = max(maxNum, dp[k]);
14
        }
15
        sum = sum + (maxNum - minNum);
16
      }
17
    }
18
    return sum;
19
  }
20
};