Is Subsequence问题及解法

最新推荐文章于 2020-02-09 11:53:25 发布

我们要爱学习

最新推荐文章于 2020-02-09 11:53:25 发布

阅读量190

点赞数

分类专栏： LeetCode算法练习（Medium）文章标签： LeetCode Medium

本文链接：https://blog.csdn.net/u011809767/article/details/77932380

版权

LeetCode算法练习（Medium）专栏收录该内容

238 篇文章 1 订阅

订阅专栏

问题描述：

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).

示例:
s = "abc", t = "ahbgdc"

Return true.

s = "axc", t = "ahbgdc"

Return false.

问题分析：

采用双指针，同时遍历s和t即可。

过程详见代码：

class Solution {
public:
    bool isSubsequence(string s, string t) {
        if (s.length() == 0) return true;
		int i = 0, j = 0;
		while (i < t.length())
		{
			if (s[j] == t[i])
			{
				j++;
				if (j == s.length()) return true;
			}
			i++;
		}
		return false;
    }
};