题目来源:https://leetcode.cn/problems/minimum-cost-to-make-all-characters-equal/
C++题解:寻找中间值,从中间向两边开始反转,不断使左右两边的值与中间相等即可使所有字符串相等。注意需要区分长度的奇偶数,并确定以哪个为中心不变值。
class Solution {
public:
long long minimumCost(string s) {
int len = s.size();
int left, right;
long long res = 0;
if(len == 1) return 0;
if(len%2 == 0){
left = len / 2 - 1;
right = left + 1;
if(s[left] != s[right]) res = res - left - 1;
}
else{
left = (len - 1) / 2 - 1;
right = (len - 1) / 2 + 1;
}
for(int ii = left; ii >= 0; ii--) {
if(s[ii] != s[ii + 1]) res = res + ii + 1;
}
for(int jj = right; jj < len; jj++){
if(s[jj] != s[jj - 1]) res = res + (len - jj);
}
return res;
}
};