LeetCode Easy Climbing Stairs

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

Solution1
带备忘录的动态规划

public class Solution1 {
    /**
     * DP: f[i] = f[i - 1] + f[i - 2];
     * @param n
     * @return
     */
    public int climbStairs(int n) {
        if (n <= 2) return n;
        int[] f = new int[n + 1];
        f[0] = 0; f[1] = 1; f[2] = 2;
        for (int i = 3; i <= n; i++) {
            f[i] = f[i - 1] + f[i - 2];
        }
        return f[n];
    }
}

Solution2
不带备忘录的动态规划

public class Solution2 {
    /**
     * Non-memo DP
     * @param n
     * @return
     */
    public int climbStairs(int n) {
        if (n <= 2) return n;
        int ans = 0;
        int a = 1, b = 2;
        for (int i = 3; i <= n; i++) {
            ans = a + b;
            a = b;
            b = ans;
        }
        return ans;
    }
}