#include<stdio.h>
int main()
{
char a1[1001];
char b1[1001];
int i = 0, j = 0;
do
{
scanf("%c",&a1[i]);
} while (a1[i++] != '\n');
do
{
scanf("%c", &b1[j]);
} while (b1[j++] != '\n');
int k = 0;
for (int ii = 0; ii < j - 1; ii++)
{
for (int jj=0;jj<i-1;jj++)
{
if (b1[ii] == a1[jj])
{
a1[jj] = ' ';
k++;
break;
}
}
}
if (k == j - 1) printf("Yes %d",i-1-k);
else printf("No %d",j-1-k);
return 0;
}
1.这道题我刚开始用统计下标来求解的。最后思路卡死做不下去了。后来发现网上的思路如此顺畅。直接老板那里有的小红珠子直接扣除来求解。瞬间流畅千里。思路很重要啊