算法设计与应用基础：第九周

392. Is Subsequence

Add to List

Description Hints Submissions Solutions

• Total Accepted: 28741
• Total Submissions: 64888
• Difficulty: Medium
• Contributor: LeetCode

Given a string s and a string t, check if s is subsequence of t.

You may assume that there is only lower case English letters in both s and t. t is potentially a very long (length ~= 500,000) string, and s is a short string (<=100).

A subsequence of a string is a new string which is formed from the original string by deleting some (can be none) of the characters without disturbing the relative positions of the remaining characters. (ie, "ace" is a subsequence of "abcde" while "aec" is not).

Example 1:
s = "abc", t = "ahbgdc"

Return true.

Example 2:
s = "axc", t = "ahbgdc"

Return false.

Follow up:

If there are lots of incoming S, say S1, S2, ... , Sk where k >= 1B, and you want to check one by one to see if T has its subsequence. In this scenario, how would you change your code?

题解：基本的题目思考起来很简单，对于s中每个字符，从上一个字符的位置（第一个字符就从0开始）开始顺序遍历字符串t直到找到相同的字符，记录当前位置，整个s都遍历完，每次都能找到就返回true，否则为false。代码如下：

对于follow up中的拓展题目，如果s有多个字符串，每个都要检测，那再用上面的方法时间会非常长，因为相当于每次都要遍历一遍t。于是换一个思路，先对t进行预处理，用一个map将每种t中出现的字符映射到它所出现的位置，用一个vector记录，这样只用遍历一遍t，在检验的过程中，只需要找map对应字母出现的位置中是否存在大于上一个字母的最小合理位置，依次验证即可，代码如下：