使给定二进制字符串相等所需的最小相邻位翻转次数

#include <iostream>
using namespace std;
// function to check if it is possible to make the string equal 
int makeEqual(string str1, string str2){
   int len = str1.length(); // getting length of the strings 
   int count = 0; // variable to count the number of steps     
   // traversing over the string 
   for(int i=0; i<len-1; i++){
      if(str1[i] == str2[i]){
         // Both the charcters are the same 
         continue;
      }
      else{
         count++;
         // update the current and the next character
         str1[i] = '1' + '0' - str1[i]; // technique to toggle the characters
         str1[i+1] = '1' + '0' -str1[i+1];
      }
   }
   // if the last element is the same means the strings are the same 
   if(str1[len-1] == str2[len-1]){
      return count;
   }
   else{
      return -1;
   }
}
int main(){
   string str1 = "101010"; // given first string 
   string str2 = "100101"; // given second string    
   // calling the function to count the minimum steps 
   // to make the string equal 
   int steps = makeEqual(str1,str2);   
   if(steps == -1){
      cout<<"It is not possible to make string "<<str1<<" equal to the string "<<str2<<endl;
   }
   else{
      cout<<"We can make string "<< str1<<" equal to string "<<str2<< " in "<<steps<<" number of steps"<<endl;
   }
   return 0;
}