<poj-1936>All in All

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. 

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

思路:

其实这个题可能就还是比较水,这好像是第一个我独立完成的题,总之值得纪念
就是暴力,从头挨个查找,看看字符串二中有几个和字符串一按照顺序相同的字符,如果恰好等于字符串一的长度就输出Yes
#include<stdio.h>
#include<string.h>

char a[100000];
char b[100000];

int main()
{
	int len1, len2;
	int i, j;
	while(~scanf("%s %s", a, b))
	{
		i = 0;
		len1 = strlen(a);
		len2 = strlen(b);
		int k = 0, count = 0;
		while(i < len1)
		{
			for(j = k; j < len2;j++)
			{
				if(a[i] == b[j])
				{
					k = j+1;         //记录已经比较完的地方
					count++;         //记录有几个相同的字符
					break;
				}
			}
			i++;
		}
		if(count == len1)
			printf("Yes\n");
		else
			printf("No\n");
	}
	return 0;
}