摘要：
class Solution: def change(self, amount: int, coins: List[int]) -> int: dp = [0]*(amount+1) dp[0] = 1 # 从面值开始遍历是为了去重 for c in coins: for i in range(c, 阅读全文
摘要：
class Solution: def coinChange(self, coins: List[int], amount: int) -> int: dp = [float("inf")] * (amount + 1) dp[0] = 0 for i in range(amount + 1): f 阅读全文
摘要：
class Solution: def minCostClimbingStairs(self, cost: List[int]) -> int: dp = cost n = len(dp) for i in range(2,n): dp[i] += min(dp[i-1],dp[i-2]) retu 阅读全文
摘要：
class Solution: def climbStairs(self, n: int) -> int: if n == 1 or n == 2: return n dp = [0] * (n + 1) dp[1] = 1 dp[2] = 2 for i in range(3, n + 1): d 阅读全文
摘要：
class Solution: def lengthOfLIS(self, nums: List[int]) -> int: def find(nums, target): left = 0 right = len(nums) while left <= right: mid = (left + r 阅读全文
