All in All 找子串 水题

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<iostream>
#include<string>
#include<cstring>
#include<cmath>
#include<cstdio>
#include<algorithm>
using namespace std;
char str1[100001],str2[100001];
int i,j,k;
int main()
{
    while(scanf("%s %s",&str1,&str2)!=EOF)
    {
        int len1=strlen(str1);
        int len2=strlen(str2);
        if(len1>len2)
        {
            puts("No");
        }
        else
           if(len1==len2)
            {
               if(strcmp(str1,str2)==0)
                 puts("Yes");
               else
                 puts("No");
            }
            else
            {
                j=0;
                bool gs=0;
                for(i=0;str2[i];i++)
                {
                    if(str2[i]==str1[j])
                       j++;
                    if(j==len1)
                    {
                        gs=1;
                        break;
                    }
                }
                if(gs==1)
                  puts("Yes");
                else
                  puts("No");
            }
    }
    return 0;
}