额。。。意识到这一章数组与字符串的题都是傻逼暴力题(范围都很小,怎么暴力都能过)后,就不用想太多了。
比如这道题,分两种情况模拟就行。有时间再把具体过程贴一下
代码:
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;
char cvt[3] = { 0, '2', '1' };
char a[105], b[105], c[105];
int ans = 0;
int main()
{
//freopen("input.txt", "r", stdin);
scanf("%s%s", a, b);
int n1 = strlen(a);
int n2 = strlen(b);
ans = n1 + n2;
for (int i = 0; i < n2; ++i)
c[i] = cvt[b[i] - '0'];
for (int i = 0; i < n2; ++i)
{
bool f = 1;
for (int j = 0; i + j < n2&&j < n1; ++j)
if (c[i + j] < a[j])
{
f = 0;
break;
}
if (f)
{
if (i + n1 < n2)
ans = min(ans, n2);
else
ans = min(ans, n1 + i);
break;
}
}
for (int i = 0; i < n1; ++i)
{
bool f = 1;
for (int j = 0; i + j < n1&&j < n2; ++j)
if (c[j] < a[i + j])
{
f = 0;
break;
}
if (f)
{
if (i + n2 < n1)
ans = min(ans, n1);
else
ans = min(ans, n2 + i);
break;
}
}
printf("%d\n", ans);
//system("pause");
//while (1);
return 0;
}