LeetCode 97. 交错字符串(动态规划)

最新推荐文章于 2024-01-31 10:27:59 发布

程旭员

最新推荐文章于 2024-01-31 10:27:59 发布

阅读量251

点赞数

分类专栏： Leetcode 文章标签：交错字符串动态规划 leetcode python

本文链接：https://blog.csdn.net/weixin_37763870/article/details/104066295

版权

Leetcode 专栏收录该内容

83 篇文章 0 订阅

订阅专栏

题目描述

给定三个字符串 s1, s2, s3, 验证 s3 是否是由 s1 和 s2 交错组成的。
示例 1:
输入: s1 = “aabcc”, s2 = “dbbca”, s3 = “aadbbcbcac”
输出: true
示例 2:
输入: s1 = “aabcc”, s2 = “dbbca”, s3 = “aadbbbaccc”
输出: false

思路

详见链接

代码

class Solution:
	def isInterleave(self,s1:str,s2:str,s3:str)->bool:
		n1 = len(s1)
		n2 = len(s2)
		n3 = len(s3)
		if n1 + n2 != n3:
			return 0
		dp = [[False]*(n2+1) for _ in range(n1+1)]
		dp[0][0] = True
		for i in range(1,n1+1):
			dp[i][0] = dp[i-1][0] and s1[i-1] == s3[i-1]
		for j in range(1,n2+1):
			dp[0][j] = dp[0][j-1] and s2[j-1] == s3[j-1]
		for i in range(1,n1+1):
			for j in range(1,n2+1):
				dp[i][j] = (dp[i-1][j] and s1[i-1]==s3[i+j-1]) or (dp[i][j-1] and s2[j-1]==s3[i+j-1])
		return dp[-1][-1]
test = Solution()
test.isInterleave("aabcc","dbbca","aadbbcbcac")