算法竞赛入门-子序列（All in All)

最新推荐文章于 2026-04-01 23:40:40 发布

原创

最新推荐文章于 2026-04-01 23:40:40 发布 · 673 阅读

收录于

这篇博客介绍了如何解决算法竞赛中的子序列问题。通过给定两个字符串s和t，你需要确定s是否是t的子序列，即t能否通过删除某些字符变为s。博主提出了一个思路，即遍历字符串并检查下标是否顺序增长，以此来验证子序列关系。最后，博客还提供了相关代码实现。

1.题目

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 remain