2道题目
392. 判断子序列
115. 不同的子序列
解题理解
392
设dp[i][j] 表示以下标i-1为结尾的字符串s,和以下标j-1为结尾的字符串t,相同子序列的长度为dp[i][j]。
s[i - 1] == t[j - 1]时,dp[i][j] = dp[i - 1][j - 1] + 1,否则就从前一列得到。
class Solution:
def isSubsequence(self, s: str, t: str) -> bool:
m = len(t)
n = len(s)
dp = [[0] * (m + 1) for _ in range(n + 1)]
for i in range(1, n + 1):
for j in range(1, m + 1):
if s[i - 1] == t[j - 1]:
dp[i][j] = dp[i - 1][j - 1] + 1
else:
dp[i][j] = dp[i][j - 1]
print(dp)
if dp[-1][-1] == n:
return True
else:
return False
115
这道题是从上一道题发展来的,区别在于上一道题只匹配一次,这道题可能匹配多次且用不同位置的字符去匹配。dp数组依然是上道题的思路,递推公式会不一样,当s[i - 1] == t[j - 1]时,dp[i][j] = dp[i - 1][j - 1] + dp[i - 1][j]不能再简单+1,因为可能会用其他位置字符匹配到,当s[i - 1] != t[j - 1]时,dp[i][j] = dp[i - 1][j]。
class Solution:
def numDistinct(self, s: str, t: str) -> int:
m = len(s)
n = len(t)
dp = [[0] * (n + 1) for _ in range(m + 1)]
for i in range(m + 1):
dp[i][0] = 1
for i in range(1, m + 1):
for j in range(1, n + 1):
if s[i - 1] == t[j - 1]:
dp[i][j] = dp[i - 1][j - 1] + dp[i - 1][j]
else:
dp[i][j] = dp[i - 1][j]
return dp[-1][-1]