### 解题思路
-
暴力,学习了一下auto遍历unordered_map<char,int>的用法
const int INF=0x3f3f3f3f;
class Solution
{
public:
int beautySum(string s)
{
int n = s.size();
int res = 0;
for(int L=0;L<n;L++){
unordered_map<char,int>dic;
for(int R=L;R<n;R++){
dic[s[R]]++;
if(dic.size()>0){
int maxx=0;
int minn=INF;
for(auto [ch,inte]:dic){
maxx=max(maxx,inte);
minn=min(minn,inte);
}
res+=maxx-minn;
}
}
}
return res;
}
};