【LeetCode】392. Is Subsequence

最新推荐文章于 2023-12-29 18:00:11 发布

Juxin_Lin

最新推荐文章于 2023-12-29 18:00:11 发布

阅读量303

点赞数

分类专栏： leetcode DP 文章标签： leetcode DP

本文链接：https://blog.csdn.net/Juxin_Lin/article/details/52997993

版权

leetcode 同时被 2 个专栏收录

39 篇文章 0 订阅

订阅专栏

10 篇文章 0 订阅

订阅专栏

Difficulty: Medium

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.

状态转移方程

f[k][j] = f[k][j-1] || f[k-1][j-1] && s[i-1] == t[j-1];

时间复杂度O(n * m)，n为s的长度，m为t的长度

class Solution {
public:
    bool isSubsequence(string s, string t) {
	int m,n,i,k;
	m=s.size();n=t.size();
	bool f[2][600005];
	for(int j=0;j<=n;j++)	f[0][j]=true;
	for(k=i=1;i<=m;i++,k=1-k)
	{
		f[k][0]=false;
		for(int j=1;j<=n;j++)
		{
			f[k][j] = f[k][j-1] || f[1-k][j-1] && s[i-1] == t[j-1];
		}
	}
	
	return f[1-k][n];	
}
};