99. Interleaving String Leetcode Python

最新推荐文章于 2025-12-02 18:04:47 发布

原创最新推荐文章于 2025-12-02 18:04:47 发布 · 677 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#dp #leetcode #python

leetcode 专栏收录该内容

166 篇文章

订阅专栏

本文介绍了一种用于判断字符串s3是否由s1和s2交错组成的方法。通过使用动态规划技术，实现了一个高效的解决方案，并提供了具体的Python代码示例。

Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2.

For example,
Given:
s1 = "aabcc",
s2 = "dbbca",

When s3 = "aadbbcbcac", return true.
When s3 = "aadbbbaccc", return false.

class Solution:
    # @return a boolean
    def isInterleave(self, s1, s2, s3):
        if len(s1) + len(s2) != len(s3):
            return False
        dp = [[False for j in range(len(s2) + 1)] for i in range(len(s1) + 1)]
        dp[0][0] = True
        for row in range(len(s1) + 1):
            dp[row][0] = s1[:row] == s3[:row]
        for col in range(len(s2) + 1):
            dp[0][col] = s2[:col] == s3[:col]
        for i in range(1, len(s1) + 1):
            for j in range(1, len(s2) + 1):
                dp[i][j] = (dp[i - 1][j] and s1[i - 1] == s3[j + i - 1]) or (dp[i][j - 1] and s2[j - 1] == s3[i + j - 1])
    
        return dp[-1][-1]