class Solution:
def isInterleave(self, s1: str, s2: str, s3: str) -> bool:
# DP
n, m = len(s1), len(s2)
if n+m != len(s3):
return False
# 初始化
dp = [[False for _ in range(m+1)]for _ in range(n+1)]
dp[0][0] = True
# 首行首列
for i in range(1, n+1):
dp[i][0] = dp[i-1][0] and s1[i-1]==s3[i-1]
for j in range(1, m+1):
dp[0][j] = dp[0][j-1] and s2[j-1]==s3[j-1]
# DP
for i in range(1, n+1):
for j in range(1, m+1):
if s3[i+j-1] == s1[i-1]:
dp[i][j] = dp[i-1][j]
if s3[i+j-1] == s2[j-1]:
dp[i][j] = dp[i][j] or dp[i][j-1]
return dp[-1][-1]
交错字符串-动态规划
该篇文章介绍了如何使用动态规划方法解决字符串交错问题,通过定义一个二维数组dp来判断给定的三个字符串s1,s2,s3是否能形成交错序列。代码展示了状态转移方程的实现过程。
摘要由CSDN通过智能技术生成