题目链接:https://vjudge.net/problem/UVA-10340
题解:本题是判断一个串是否能由另一个串组成,不一定连续,但必须按顺序
水题
代码:
#include<cstring>
#include<string>
#include<iostream>
#include<algorithm>
using namespace std;
string sma,big;
int main()
{
while(cin>>sma>>big)
{
int fl=0;
int len1=sma.length();
int len2=big.length();
int k=0;
for(int i=0;i<len1;i++)
{
for(;k<len2;k++)
{
if(k==len2-1&&sma[i]!=big[k])
fl=1;
if(sma[i]==big[k])
{
k++;
break;
}
}
}
if(fl)
cout<<"No"<<endl;
else
cout<<"Yes"<<endl;
}
return 0;
}