Leetcode 刷题笔记1 动态规划part11
leetcode 1143 最长公共子序列 难点在于保持相对顺序 class Solution:def longestCommonSubsequence(self, text1: str, text2: str) -> int:dp [[0] * (len(text2) 1) for i in range(len(text1) 1)]for i in range(1, len(text1) 1):for j in range(1, len(text2) …
2025-11-10