Climbing Stairs-LeetCode#70

70.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

爬楼梯。给出楼梯的总数n，每次可以爬一格或者两格楼梯，计算可以通过多少种方式爬完。
其实是一个斐波那契数列，可以构造一个数组，其中每个节点存储每到一个楼梯n的解

public int climbStairs(int n) {
    int[] tempList = new int[n];
    return climb(n, tempList);
}
private int climb(int n, int[] tempList) {
    if (n == 1 || n == 0) {
        return 1;
    }
    if (tempList[n - 1] == 0) {
        tempList[n - 1] = climb(n - 1, tempList) + climb(n - 2, tempList);
    }
    return tempList[n - 1];
}