代码随想录第38天| 509.斐波那契数 70.爬楼梯 746.使用最小花费爬楼梯

509.斐波那契数

题目链接：https://leetcode.cn/problems/fibonacci-number/

class Solution:
    def fib(self, n: int) -> int:
        if n < 2:
            return n
        i,j = 0, 1
        res = 0
        for k in range(1,n):
            res = i + j
            i = j
            j = res
        return res

70.爬楼梯

题目链接：https://leetcode.cn/problems/climbing-stairs/

class Solution:
    def climbStairs(self, n: int) -> int:
        dp = [0]*(n+1)
        dp[0] = 1
        dp[1] = 1
        for i in range(2, n+1):
            cur = dp[0] + dp[1]
            dp[0] = dp[1]
            dp[1] = cur
        return dp[1]

746.使用最小花费爬楼梯

题目链接：https://leetcode.cn/problems/min-cost-climbing-stairs/

理解好题目，并且区分好五部曲。

class Solution:
    def minCostClimbingStairs(self, cost: List[int]) -> int:
        dp = [0]*len(cost)
        dp[0] = cost[0]
        dp[1] = cost[1]

        for i in range(2,len(cost)):
            dp[i] = min(dp[i-1], dp[i-2]) + cost[i]
        
        return min(dp[len(cost)-1],dp[len(cost)-2])