All in All - poj 1936 (子串)

本文介绍了一种通过双指针技术实现的字符串子序列查找算法。该算法可以在待查找序列中高效判断指定子序列是否存在,适用于多种编程挑战,如加密验证等。
字符串子序列查找问题,设置两个指针,一个指向子序列,另一个指向待查找的序列,查找个字符串一次即可判断。
 
 1 #include <iostream>
 2 #include <string.h>
 3 using namespace std;
 4 char s[100002];
 5 char t[100002];
 6 int main() {
 7 
 8     while(cin>>s>>t){
 9         int length1=strlen(s);
10         int length2=strlen(t);
11         int i=0,j=0;
12         for(i=0,j=0;i<length1&&j<length2;){
13             if(s[i]==t[j]){
14                 i++;
15                 j++;
16             }else{
17                 j++;
18             }
19         }
20         if(i==length1)
21             cout<<"Yes"<<endl;
22         else
23             cout<<"No"<<endl;
24     }
25     return 0;
26 }

附:

Time Limit: 1000MS Memory Limit: 30000K
Total Submissions: 29592 Accepted: 12269

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

转载于:https://www.cnblogs.com/sdxk/p/4691377.html

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值