T - All in All

Myth丶恋晨 2022-03-21 13:24 132阅读 0赞

### 题目描述： ###

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  
题意，就是给两个字符串，第二个字符中的字符是不是包括第一个字符串中的字符。  
分析：直接暴力，负责度为N，不会超时 。

#include"stdio.h"
    #include"string.h"
    int main()
    {
        char s[100001],t[100001];
        int i,j,len1,len2;
        while(~scanf("%s%s",s,t))
        {
            len1=strlen(s);
            len2=strlen(t);
            i=0;j=0;
            for(i=0;i<len2;i++)
            {
                if(t[i]==s[j])
                    j++;
                if(j==len1)
                    break;
            }
            if(i==len2)
                printf("No\n");
            else
                printf("Yes\n");
    
        }
    }