public int beautySum(String s) {
int res = 0;
for (int i = 0; i < s.length(); i++) {
int[] cnt = new int[26];
int maxFreq = 0;
for (int j = i; j < s.length(); j++) {
cnt[s.charAt(j) - 'a']++;
maxFreq = Math.max(maxFreq, cnt[s.charAt(j) - 'a']);
int minFreq = s.length();
for (int k = 0; k < 26; k++) {
if (cnt[k] > 0) {
minFreq = Math.min(minFreq, cnt[k]);
}
}
res += maxFreq - minFreq;
}
}
return res;
}
2022.12.12-----leetcode.1781
最新推荐文章于 2024-07-25 19:28:17 发布