力扣 70. 爬楼梯

leetcode
Word count: 84   |   Reading time≈ 1 min

动态规划 + 一维数组

1
2
3
4
5
6
7
8
9
10
11
def climbStairs(n):
    if n == 1:
        return 1
    elif n == 2:
        return 2
    dp = [0] * n
    dp[0], dp[1] = 1, 2
    for i in range(2, n):
        dp[i] = dp[i - 1] + dp[i - 2]
    
    return dp[-1]

动态规划 + 两个数

1
2
3
4
5
6
7
8
9
10
def climbStairs(n):
    if n == 1:
        return 1
    elif n == 2:
        return 2
    a, b = 1, 2
    for i in range(2, n):
        a, b = b, a + b
    
    return b
  • Copyright： Copyright is owned by the author. For commercial reprints, please contact the author for authorization. For non-commercial reprints, please indicate the source.
  • Copyrights © 2022 eightyninth
  • Visitors: | Views:

请我喝杯咖啡吧~

支付宝
微信