classSolution{
public:intminOperations(string s){
int cnt1 =0;int cnt2 =0;for(int i =0; i < s.size(); i++){
if( i %2== s[i]%2){
cnt1 ++;}if(i %2!= s[i]%2){
cnt2++;}}returnmin(cnt1,cnt2);}};
统计同构子字符串的数目
classSolution{
public:intcountHomogenous(string s){
int res =0;int left =0, right =0;while(right < s.length()){
if(s[right]!= s[left]){
left = right;}
res =(res + right - left +1)%1000000007;
right++;}return res;}};