首页 > 编程语言 > 详细

99. Interleaving String Leetcode Python

时间:2015-03-25 09:00:18      阅读:433      评论:0      收藏:0      [点我收藏+]

Given s1s2s3, 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

原文:http://blog.csdn.net/hyperbolechi/article/details/44614071

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!