forked from Google-DSC-TMSL/ProjectAlgorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
/
InterleavingStringsProg.py
27 lines (23 loc) · 1018 Bytes
/
InterleavingStringsProg.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
# INTERLEAVING STRINGS( LEETCODE 97) SOLUTION
# Question : https://leetcode.com/problems/interleaving-string/
#--------------------------------------------------------------------------
class Solution:
def isInterleave(self, s1: str, s2: str, s3: str) -> bool:
m, n = len(s1), len(s2)
if m + n != len(s3):
return False
dp = [[False] * (n + 1) for _ in range(m + 1)]
dp[0][0] = True
for i in range(1, m + 1):
dp[i][0] = dp[i - 1][0] and s1[i - 1] == s3[i - 1]
for j in range(1, n + 1):
dp[0][j] = dp[0][j - 1] and s2[j - 1] == s3[j - 1]
for i in range(1, m + 1):
for j in range(1, n + 1):
choose_s1, choose_s2 = False, False
if s1[i - 1] == s3[i + j - 1]:
choose_s1 = dp[i - 1][j]
if s2[j - 1] == s3[i + j - 1]:
choose_s2 = dp[i][j - 1]
dp[i][j] = choose_s1 or choose_s2
return dp[m][n]