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.
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
YesNoYesNo
#include <stdio.h>#include <string.h>int main(){ char str1[100005],str2[100005]; while(~scanf("%s%s",str1,str2)) { if(strstr(str2,str1)) { printf("Yes\n"); continue; } int len1,len2,i,j,cnt = 0,flag; len1 = strlen(str1); len2 = strlen(str2); for(i = 0; i<len1; i++) { flag = 1; for(j = 0; j<len2; j++) { if(str1[i] == str2[j]) { cnt++; flag = 0; strcpy(str2,str2+j+1); // puts(str2); len2 = strlen(str2); break; } } if(flag) { break; } } if(flag) { printf("No\n"); continue; } if(cnt == len1) printf("Yes\n"); else printf("No\n"); } return 0;}
再分享一下我老师大神的人工智能教程吧。零基础!通俗易懂!风趣幽默!还带黄段子!希望你也加入到我们人工智能的队伍中来!https://blog.csdn.net/jiangjunshow