本文共 1636 字，大约阅读时间需要 5 分钟。
| Time Limit: 1000MS | | Memory Limit: 30000K |
| Total Submissions: 31754 | | Accepted: 13179 |
Description
You have devised a new encryption technique which encodes a message by inserting between its characters randomly generated strings in a clever way. Because of pending patent issues we will not discuss in detail how the strings are generated and inserted into the original message. To validate your method, however, it is necessary to write a program that checks if the message is really encoded in the final string.
Given two strings s and t, you have to decide whether s is a subsequence of t, i.e. if you can remove characters from t such that the concatenation of the remaining characters is s.
Input
The input contains several testcases. Each is specified by two strings s, t of alphanumeric ASCII characters separated by whitespace.The length of s and t will no more than 100000.
Output
For each test case output "Yes", if s is a subsequence of t,otherwise output "No".
Sample Input
sequence subsequenceperson compressionVERDI vivaVittorioEmanueleReDiItaliacaseDoesMatter CaseDoesMatter
Sample Output
YesNoYes No
开两个字符数组，遍历第二个数组，遍历时第一个数组从头开始匹配，匹配到就跳到下一个继续匹配，到遍历结束时，若第一个数组全部匹配则输出Yes,否则No.
代码：
#include #include #include using namespace std;int main(){ char a[101234], b[101234]; while(~scanf("%s%s", a, b)) { int i,top=0; int len=strlen(a); for(i=0; b[i]; i++) { if(b[i]==a[top]) { top++; if(top>=len)break; } } if(top>=len)printf("Yes\n"); else printf("No\n"); } return 0;}
转载地址：http://yiywb.baihongyu.com/