【LeetCode】70. Climbing Stairs

70. Climbing Stairs

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.
Difficulty：Easy
Example:

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

方法1: 斐波那契

• Time complexity : $O\left(n\right)$
• Space complexity : $O\left(n\right)$
  思路：
  dp[i]=dp[i−1]+dp[i−2]

 class Solution {
public:
    int climbStairs(int n) {
        vector<int> step(n+1);
        step[1] = 1;
        step[2] = 2;
        for(int i = 3; i < n+1; i++){
            step[i] = step[i-1] + step[i-2];
        }
        return step[n];
    }
};

原始写法

 public class Solution {
    public int climbStairs(int n) {
        int memo[] = new int[n + 1];
        return climb_Stairs(0, n, memo);
    }
    public int climb_Stairs(int i, int n, int memo[]) {
        if (i > n) {
            return 0;
        }
        if (i == n) {
            return 1;
        }
        if (memo[i] > 0) {
            return memo[i];
        }
        memo[i] = climb_Stairs(i + 1, n, memo) + climb_Stairs(i + 2, n, memo);
        return memo[i];
    }
}

方法2: 斐波那契，空间优化

• Time complexity : $O\left(n\right)$
• Space complexity : $O\left(1\right)$
  思路：
  三个变量代替数组

class Solution {
public:
    int climbStairs(int n) {
        if (n == 1)
            return 1;
        int first = 1;
        int second = 2;
        for(int i = 3; i < n+1; i++){
            int third = first + second;
            first = second;
            second = third;
        }
        return second;
    }
};