问题描述
you are climbing a staircase. It takes n steps to reach the top.
Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?
Example 1:
1
2
3
4
5
| Input: n = 2
Output: 2
Explanation: There are two ways to climb to the top.
1. 1 step + 1 step
2. 2 steps
|
Example 2:
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
| Input: n = 3
Output: 3
Explanation: There are three ways to climb to the top.
1. 1 step + 1 step + 1 step
2. 1 step + 2 steps
3. 2 steps + 1 step
```
Constraints:
- 1 <= n <= 45
## 解题思路
- dp[i]表示到达台阶i处有多少种方法
- 到达台阶i处有两种方式，i-1跳和i-2跳，所以dp[i] = dp[i-1]+dp[i-2]
- 最后返回dp[n]即可
- 代码如下：
- JavaScript
```JavaScript
/**
* @param {number} n
* @return {number}
*/
var climbStairs = function(n) {
var dp = [];
dp[0] = 0;
dp[1] = 1;
dp[2] = 2;
for (var i = 3; i <= n; i++) {
dp[i] = dp[i-1] + dp[i-2];
}
return dp[n];
};
|