Problem:70. Climbing Stairs
Question
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.
1. 1 step + 1 step + 1 step
2. 1 step + 2 steps
3. 2 steps + 1 step
思路
爬楼梯问题
很简单,每种情况下有两种选择,爬一层或两层
所以给定层数,总共的方式 第一步爬一层 和 第一步爬两层 的所有方式的和
状态方程: ways(i) = ways(i-1) + ways(i-2)
代码
class Solution {
public:
int climbStairs(int n) {
int *dp = new int[n+1];
dp[0] = 1;
dp[1] = 1;
for (int i = 2; i <= n; i++) {
dp[i] = dp[i - 1] + dp[i - 2];
}
return dp[n];
}
};