本来以为是个奇怪的题,后来发现只是逐个匹配就好了。
#include<iostream>
#include<string>
using namespace std;
int main()
{
string s, pat;
int i,j;
int ls, lp;
while (cin >> pat >> s){
ls = s.length();
lp = pat.length();
for (i = 0, j = 0; i < ls;){
if (s[i] == pat[j]){
i ++; j ++;
}
else{
i ++;
}
if (j == lp){
cout << "Yes" << endl;
break;
}
}
if (i == ls && j != lp){
cout << "No" << endl;
}
}
return 0;
}