代码随想录刷题第三十八天

动态规划基础理论

斐波那契数 (LC 509)

题目思路：

代码实现：

class Solution:def fib(self, n: int) -> int:if n<=1: return ndp = [0 for _ in range(n+1)]dp[1] = 1for i in range(2, n+1):dp[i] = dp[i-1]+dp[i-2]        return dp[n]

爬楼梯 (LC 70)

题目思路：

代码实现：

class Solution:def climbStairs(self, n: int) -> int:if n<=2: return ndp = [0 for _ in range(n+1)]dp[1] = 1dp[2] = 2for i in range(3, n+1):dp[i] = dp[i-1]+dp[i-2]        return dp[n]

使用最小花费爬楼梯 (LC 746)

题目思路：

代码实现：

class Solution:def minCostClimbingStairs(self, cost: List[int]) -> int:if len(cost)<=1:return 0dp = [0 for _ in range(len(cost)+1)]for i in range(2, len(cost)+1):dp[i] = min(dp[i-1]+cost[i-1], dp[i-2]+cost[i-2])return dp[len(cost)]