矩阵翻转 贪心 水题

#include <bits/stdc++.h>

using namespace std;

#define maxn 1001

string s1, s2;

int mark[maxn];

int main()

{

while(cin>>s1)

{

memset(mark, 0, sizeof(mark));

cin>>s2;

int len = s1.size();

int cnt = 0,ans = 0;

for(int i=0; i<len; i++)

{

if(s1[i] != s2[i]) mark[++cnt] = i;

}

for(int i=2; i<=cnt; i++)

ans += (mark[i] - mark[i-1]);

cout<<ans<<endl;

}

return 0;

}