Description:
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
解题思路:
可以这样理解:比如当下台阶数为n,则到达当前台阶有两种可能性:
1.从n-1号台阶走1个台阶到达;
2.从n-2号台阶走2个台阶到达。
起初,用递归做,但是超时了,因此需要优化算法,根据上面的思路可以利用简单的动态规划完成。
列出动态规划的式子:dp[n] = dp[n-1] + dp[n-2];
以及一些基本的情况:
当 n <= 0时,result = 0;
当 n == 1时,result = 1;
当 n == 2时,result = 2;
代码:
1 class Solution { 2 public: 3 int climbStairs(int n) { 4 vector<int> dp(n+1); 5 dp[0] = 0; 6 dp[1] = 1; 7 dp[2] = 2; 8 for (int i = 3; i <= n; i++) { 9 dp[i] = dp[i-1] + dp[i-2]; 10 } 11 return dp[n]; 12 } 13 };