Problem 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 subsequence
person compression
VERDI vivaVittorioEmanueleReDiItalia
caseDoesMatter CaseDoesMatter
Sample Output
Yes
No
Yes
No
题目大意:给定两个字符串,看前者是否是后者的子串
解题思路:定义两个索引,依次比较即可
代码:
#include<stdio.h>
#include<string.h>
int main()
{
int i,j;
char s1[100005],s2[100005];
while(~scanf("%s%s",s1,s2))
{
long len1=strlen(s1);
long len2=strlen(s2);
i=j=0;
while(j<len2)
{
if(s1[i]==s2[j])
{
i++;
j++;
if(i==len1)
{
printf("YES\n");
break;
}
}
else
{
j++;
if(j==len2)
{
printf("No\n");
break;
}
}
}
}
}