题目地址:https://leetcode.com/problems/climbing-stairs/submissions/
题目描述
You are climbing a stair case. It takes n steps to reach to the top.
Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?
Note: Given n will be a positive integer.
Example 1:
Input: 2
Output: 2
Explanation: There are two ways to climb to the top.
1. 1 step + 1 step
2. 2 steps
Example 2:
Input: 3
Output: 3
Explanation: There are three ways to climb to the top.
4. 1 step + 1 step + 1 step
5. 1 step + 2 steps
6. 2 steps + 1 step
解法:动态规划
对于
n
(
n
>
=
3
)
n(n>=3)
n(n>=3)个台阶,可以先爬到第
n
−
1
n-1
n−1个台阶,然后再爬一个台阶,或者先爬到
n
−
2
n-2
n−2个台阶,然后爬两个台阶,因此有:
d
p
[
n
]
=
d
p
[
n
−
2
]
+
d
p
[
n
−
1
]
dp[n] = dp[n-2] + dp[n-1]
dp[n]=dp[n−2]+dp[n−1]
class Solution:
def climbStairs(self, n: int) -> int:
dp = [0 for i in range(n+1)]
dp[0] = 1
dp[1] = 1
for i in range(2, n+1):
dp[i] = dp[i-2] + dp[i-1]
return dp[n]