【力扣1143. 最长公共子序列】dp多种解法(python3)

题目描述

https://leetcode-cn.com/problems/longest-common-subsequence/

思路题解

dp (m+1)*(n+1)版

https://leetcode-cn.com/problems/longest-common-subsequence/solution/zui-chang-gong-gong-zi-xu-lie-by-leetcod-y7u0/

class Solution:
    def longestCommonSubsequence(self, text1: str, text2: str) -> int:
        m,n=len(text1),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]=dp[i-1][j-1]+1
                else:
                    dp[i][j]=max(dp[i][j-1],dp[i-1][j])
        return dp[-1][-1]

dp m*n版

dp[i][j]代表text1前i个数和text2前j个数的最长公共子序列的长度

class Solution:
    def longestCommonSubsequence(self, text1: str, text2: str) -> int:
        m,n=len(text1),len(text2)
        dp=[[0]*n for _ in range(m)]
        j=0
        while j<n:
            if text1[0]==text2[j]:
                while j<n:
                    dp[0][j]=1
                    j+=1
            j+=1
        for i in range(1,m):
            for j in range(n):
                if text1[i]==text2[j]:
                    if j==0:dp[i][j]=1
                    else:dp[i][j]=dp[i-1][j-1]+1
                else:
                    if j==0:dp[i][j]=dp[i-1][j]
                    else:dp[i][j]=max(dp[i][j-1],dp[i-1][j])
        return dp[-1][-1]