97. 交错字符串（Medium）

• 题解
  

class Solution:
    def isInterleave(self, s1: str, s2: str, s3: str) -> bool:
        l1, l2, l3 = len(s1), len(s2), len(s3)

        if l1 + l2 != l3:
            return False

        # dp[i][j]表示s1[0..i]与s2[0..j]能否构成s3[0..i+j]
        # dp = [[False] * (l2 + 1) for _ in range((l1 + 1))]
        dp = [[False] * (l2 + 1)] * (l1+ 1)
        dp[0][0] = True

        # 初始化第一列
        for i in range(1, l1 + 1):
            dp[i][0] = (dp[i-1][0] and s1[i-1] == s3[i-1])
        # 初始化第一行
        for i in range(1, l2 + 1):
            dp[0][i] = (dp[0][i-1] and s2[i-1] == s3[i-1])

        # dp[i][j]取决于两种情况：
        # 1. 若s1的第i个字符s1[i-1]与s3的第i+j个字符s3[i+j-1]相等，
        #    则只需考虑s1的前i-1个字符与s2的前j个字符能否构成交错串，即dp[i-1][j]是否成立
        # 2. 与1相似
        for i in range(1, l1 + 1):
            for j in range(1, l2 + 1):
                dp[i][j] = (dp[i][j-1] and s2[j-1] == s3[i+j-1]) or (dp[i-1][j] and s1[i-1] == s3[i+j-1])
        
        return dp[-1][-1]

• dp空间优化

class Solution:
    def isInterleave(self, s1: str, s2: str, s3: str) -> bool:
        m, n = len(s1), len(s2)
        if len(s3) != m + n:
            return False
        if m == 0:
            return s3 == s2
        if n == 0:
            return s3 == s1
        dp = [False for _ in range(n + 1)]
        dp[0] = True
        for i in range(0, m + 1):
            for j in range(0, n + 1):
                if i > 0:
                    dp[j]  = (s1[i-1] == s3[i+j-1] and dp[j])
                if j > 0:
                    dp[j]  = dp[j] or (s2[j-1] == s3[i+j-1] and dp[j-1])
        return dp[-1]