97_interleaving_string.py

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

'''
    This is my personal record of solving Leetcode Problems. 
    If you have any questions, please discuss them in [Issues](https://github.com/mengxinayan/leetcode/issues).
    Copyright (C) 2020-2022  mengxinayan

    This program is free software: you can redistribute it and/or modify
    it under the terms of the GNU General Public License as published by
    the Free Software Foundation, either version 3 of the License, or
    (at your option) any later version.

    This program is distributed in the hope that it will be useful,
    but WITHOUT ANY WARRANTY; without even the implied warranty of
    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    GNU General Public License for more details.

    You should have received a copy of the GNU General Public License
    along with this program.  If not, see <http://www.gnu.org/licenses/>.
'''