动态规划
class Solution:
def longestCommonSubsequence(self, text1: str, text2: str) -> int:
m, n = len(text1), len(text2)
dp = [[0]*(n+1) for _ in range(0, 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] = dp[i-1][j-1] + 1
else:
dp[i][j] = max(dp[i-1][j], dp[i][j-1])
return dp[m][n]
题解
https://leetcode-cn.com/problems/longest-common-subsequence/solution/zui-chang-gong-gong-zi-xu-lie-by-leetcod-y7u0/
公式(1)
text1和text2的长度分别是M和N
text1和text2的数组索引从0开始,所以是i-1和j-1
- 划重点了
动态规划可不是什么贪心算法那么简单哦,它能保证最优解,能保证最优解的前提是,是一个马尔可夫过程!!!
比如这道题题目中dp[i][j]是单调不减的性质
参考题解:
https://leetcode-cn.com/problems/longest-common-subsequence/solution/by-flix-6gy2/
终于做完了动态规划,不太理解动态规划的思维方式,以后多多联系吧。小伙伴们求关注、求收藏、求点赞哦