1143. Longest Common Subsequence (Medium) - TengnanYao/daily_leetcode GitHub Wiki

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