279 完全平方数MX10000 f[0][inf]*MX for i in range(1,isqrt(MX)1): for j in range(i*i,MX1): f[j]min(f[j],f[j-i*i]1) class Solution: def numSquares(self, n: int) - int: return f[n]322 零钱兑换class Solution: def coinChange(self, coins: list[int], amount: int) - int: f[0][inf]*amount for x in coins: for c in range(x,amount1): f[c]min(f[c],f[c-x]1) return f[amount] if f[amount]inf else -170 爬楼梯class Solution: def climbStairs(self, n: int) - int: f0f11 for _ in range(2,n1): f0,f1f1,f1f0 return f1 2026.9.29
279 完全平方数MX10000 f[0][inf]*MX for i in range(1,isqrt(MX)1): for j in range(i*i,MX1): f[j]min(f[j],f[j-i*i]1) class Solution: def numSquares(self, n: int) - int: return f[n]322 零钱兑换class Solution: def coinChange(self, coins: list[int], amount: int) - int: f[0][inf]*amount for x in coins: for c in range(x,amount1): f[c]min(f[c],f[c-x]1) return f[amount] if f[amount]inf else -170 爬楼梯class Solution: def climbStairs(self, n: int) - int: f0f11 for _ in range(2,n1): f0,f1f1,f1f0 return f1 RELATED READING
延伸阅读
更多一线实战笔记与深度复盘，助您持续精进
