递归
别问为什么从从后一个开始看就可以想到递归,嗯,问就是多做题,加油!
画出递归状态树就很了然了,注意base是-1表示为空。
没啥毛病,但是超时了。。。
class Solution:
def longestCommonSubsequence(self, text1: str, text2: str) -> int:
def helper(i, j):
if i == -1 or j == -1:
return 0
if text1[i] == text2[j]:
return 1 + helper(i-1, j-1)
else:
return max(helper(i-1, j), helper(i, j-1))
return helper(len(text1)-1, len(text2)-1)
动态规划
根据递归反过来从上到下地写DP, 存储一个二维的DPtable
base case: 首行首列添0(根据递归最后的步骤)
状态转移:dp[i][j] = 1 + dp[i - 1][j - 1]
class Solution:
def longestCommonSubsequence(self, text1: str, text2: str) -> int:
m = len(text1)
n = len(text2)
dp = [[0] * (n + 1) for _ in range(m + 1)]
for i in range(1, m + 1):
for j in range(1, n + 1):
if text1[i - 1] == text2[j - 1]:
dp[i][j] = 1 + dp[i - 1][j - 1]
else:
dp[i][j] = max(dp[i - 1][j], dp[i][j - 1])
return dp[-1][-1]