POJ-1936 All in All（字符串）

最新推荐文章于 2019-07-17 06:37:18 发布

五角场的夜风

最新推荐文章于 2019-07-17 06:37:18 发布

阅读量247

点赞数 1

分类专栏：题解文章标签：字符串 POJ ACM 判定问题 All in All

本文链接：https://blog.csdn.net/weixin_41676881/article/details/89603711

版权

该博客讨论的是POJ-1936问题，涉及字符串处理和子序列判断。题目要求确定给定的字符串s是否为字符串t的子序列，即能否通过删除t中的某些字符得到s。博主提供了解决问题的思路，包括从t中找到与s匹配的字符并逐步比较，以及最终的AC代码实现。

摘要由CSDN通过智能技术生成

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.