题意:
两个串s,t,判断s是否可由删除t中字符得到。
思路:
很简单,直接扫描+判断即可
代码如下:
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 100005;
char stra[N], strb[N];
int main() {
while (~scanf("%s%s",stra,strb)) {
int lena = strlen(stra);
int lenb = strlen(strb);
int k = 0;
for (int i = 0; i < lenb; i++) {
if (stra[k] == strb[i])
k++;
}
if (k < lena)
printf("No\n");
else
printf("Yes\n");
}
}