1.题目
给定三个字符串
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
都由小写英文字母组成
2.代码
class Solution:
def isInterleave(self, s1: str, s2: str, s3: str) -> bool:
"""获取三个字符串的长度"""
size_1 = len(s1)
size_2 = len(s2)
size_3 = len(s3)
"""特殊情况的判断"""
if size_1 + size_2 != size_3: return False
if size_1 == 0: return s2 == s3
if size_2 == 0: return s1 == s3
"""dp数组的初始化"""
dp = [[True] * (size_1 + 1) for _ in range(size_2 + 1)]
for i in range(1, size_1 + 1):
dp[0][i] = dp[0][i - 1] and s1[i - 1] == s3[i - 1]
for i in range(1, size_2 + 1):
dp[i][0] = dp[i - 1][0] and s2[i - 1] == s3[i - 1]
"""动态规划求结果"""
for i in range(1, size_2 + 1):
for k in range(1, size_1 + 1):
dp[i][k] = ((dp[i - 1][k] and s2[i - 1] == s3[i + k - 1]) or
(dp[i][k - 1] and s1[k - 1] == s3[i + k - 1]))
return dp[-1][-1]
3.思路
3.1 dp数组含义的确定
dp[i][k]表示:长度为k的s1字串和长度为i的s2字串能否组成长度为(i + k)的s3字串
3.2 dp数组递推公式的确定
如果s1和s2能组成s3,那么s3[i + k - 1]只可能是s1[k - 1],或者是s2[i - 1]
当s3[i + k - 1] == s1[k - 1]时,dp[i][k]由s1[k - 2]和s2[i - 1]能否组成s3[i + k - 2]决定,即dp[i][k - 1]
同理, 当s3[i + k - 1] == s2[i - 1]时,dp[i][k]由dp[i - 1][k]决定
因此,dp[i][k] = ((dp[i - 1][k] and s2[i - 1] == s3[i + k - 1]) or
(dp[i][k - 1] and s1[k - 1] == s3[i + k - 1]))
3.3 dp数组的初始化和遍历顺序
因为dp公式需要上一层和最左一层的数据,所以需要这两层进行初始化,同时也要求遍历需要从上往下,从左往右