摘要:
题目描述: 方法:动态规划: 自底向上: class Solution: def minDistance(self, word1: str, word2: str) -> int: n = len(word1) m = len(word2) dp = [[0 for _ in range(n+1)] 阅读全文
摘要:
题目描述: 方法一:动态规划 一:超时 class Solution: def numSquares(self, n: int) -> int: dp = [float("inf")] * (n + 1) dp[0] = 0 for i in range(1, n + 1): for j in ra 阅读全文