99. Interleaving String Leetcode Python

浏览数：93 / 时间：2015年06月08日

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]

郑重声明：本站内容如果来自互联网及其他传播媒体，其版权均属原媒体及文章作者所有。转载目的在于传递更多信息及用于网络分享，并不代表本站赞同其观点和对其真实性负责，也不构成任何其他建议。

99. Interleaving String Leetcode Python