算法第18周Climbing Stairs[easy]

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

---

Solution

这道题是爬楼梯问题，共有n层台阶，一次可跳一个或两个台阶。我们采用动态规划的方法。dp[i]代表到达第i+1层台阶可选择的途径条数。显然

dp[i] = dp[i-1]+dp[i-2];

class Solution {
public:
    int climbStairs(int n) {
        int dp[n];
        if (n == 0) return 0;
        if (n == 1) return 1;
        dp[0] = 1;
        dp[1] = 2;
        for (int i = 2; i < n; i++) {
            dp[i] = dp[i-1]+dp[i-2];
        }
        return dp[n-1];
    }
};