//遍历ch2,然后从ch1中找到第一次出现ch2[i]的位置,然后交换并计数
#include <iostream>
#include <cstring>
using namespace std;
void change(int , int);
char ch1[5001];
char ch2[5001];
int main()
{
int len;
int num1;
int num2;
int count;
while(cin >> ch1 >> ch2)
{
len = strlen(ch1);
num1 = num2 = 0;
count = 0;
for(int i = 0; i < len; i++)
{
if(ch1[i] == '+')
num1++;
if(ch2[i] == '+')
num2++;
}
if(num1 != num2)
{
cout << -1 << endl;
continue;
}
for(int i = 0; i < len; i++)
{
if(ch1[i] != ch2[i])
{
for(int j = i+1; j < len; j++)
{
if(ch1[j] == ch2[i])
{
change(i, j);
count += j - i;
break;
}
}
}
}
cout << count << endl;
}
}
void change(int i, int j)
{
char t;
t = ch1[j];
for(int k = j; k > i; k--)
{
ch1[k] = ch1[k-1];
}
ch1[i] = t;
}
南阳理工OJ_题目915 +-字符串
最新推荐文章于 2018-03-11 23:11:23 发布