题目链接
题目描述
给定三个字符串 s1、s2、s3,请判断 s3 能不能由 s1 和 s2 交织(交错) 组成。
两个字符串 s 和 t 交织 的定义与过程如下,其中每个字符串都会被分割成若干 非空 子字符串:
s = s1 + s2 + ... + sn
t = t1 + t2 + ... + tm
|n - m| <= 1
交织 是 s1 + t1 + s2 + t2 + s3 + t3 + ... 或者 t1 + s1 + t2 + s2 + t3 + s3 + ...
提示:a + b 意味着字符串 a 和 b 连接。示例 1:
输入:s1 = "aabcc", s2 = "dbbca", s3 = "aadbbcbcac"
输出:true
示例 2:输入:s1 = "aabcc", s2 = "dbbca", s3 = "aadbbbaccc"
输出:false
示例 3:输入:s1 = "", s2 = "", s3 = ""
输出:true
提示:
0 <= s1.length, s2.length <= 100
0 <= s3.length <= 200
s1、s2、和 s3 都由小写英文字母组成
解题思路
dp[i][j]表示s1的第i位以前和s2的第j位以前能交织成s3的第i+j位以前
所以
且当前位置的s1或s2等于当前位置的s3
代码
Python
class Solution:
def isInterleave(self, s1: str, s2: str, s3: str) -> bool:
x, y, z = len(s1), len(s2), len(s3)
if x + y != z:
return False
dp = [[False for _ in range(y + 1)] for _ in range(x + 1)]
dp[0][0] = True
for i in range(x + 1):
for j in range(y + 1):
if i - 1 >= 0 and s1[i - 1] == s3[i + j - 1]:
dp[i][j] |= dp[i - 1][j]
if j - 1 >= 0 and s2[j - 1] == s3[i + j - 1]:
dp[i][j] |= dp[i][j - 1]
return dp[x][y]