水题, 输入两个字符串s和t。
思路是对t遍历, 找是否有相同字符。
代码:
//xi 3.9 UVa10340--All in All 子序列.cpp
#include <cstring>
#include <cstdio>
using namespace std;
#define maxn 100005
int fun(char s1[], char s2[], int len1, int len2)
{
for (int i = 0, j = 0; i < len1; i++, j++)
{
// printf("i %d s1[i] %c\n", i, s1[i]);
while(j < len2 && s1[i] != s2[j]) j++;//,printf("j %d s2[j] %c \n", j, s2[j]);//遍历后者,找前者往后是否有对应的字符。
if(j == len2) return 0; //遍历完之后, 失败
}
}
int main()
{
char s1[maxn], s2[maxn];
while(scanf("%s%s", &s1, &s2) == 2)
{
int len1 = strlen(s1);
int len2 = strlen(s2);
if(fun(s1, s2, len1, len2)) printf("Yes\n");//putchar("Yes\n");
else printf("No\n");
}
return 0;
}