leetcode 746. Min Cost Climbing Stairs（爬楼梯最小cost）

On a staircase, the i-th step has some non-negative cost cost[i] assigned (0 indexed).

Once you pay the cost, you can either climb one or two steps. You need to find minimum cost to reach the top of the floor, and you can either start from the step with index 0, or the step with index 1.

Example 1:
Input: cost = [10, 15, 20]
Output: 15
Explanation: Cheapest is start on cost[1], pay that cost and go to the top.
Example 2:
Input: cost = [1, 100, 1, 1, 1, 100, 1, 1, 100, 1]
Output: 6
Explanation: Cheapest is start on cost[0], and only step on 1s, skipping cost[3].
Note:
cost will have a length in the range [2, 1000].
Every cost[i] will be an integer in the range [0, 999].

给出一个过路费的数组，每个台阶有个过路费，付过路费后可以爬1到2步，问到top至少要多少过路费。
top是指超出数组的右边界，可以理解为在最右边加一个0.
可以从index 0或1开始

思路：
倒着往前看
dp[n] = min(dp[n-1] + cost[n-1], dp[n-2] + cost[n-2])
这个dp是不包含过路费的
最后返回dp[n]

    public int minCostClimbingStairs(int[] cost) {
        if(cost == null || cost.length == 0) {
            return 0;
        }
        
        int n = cost.length;
        Integer[] dp = new Integer[n+1];
        dp[0] = 0;
        dp[1] = 0;
                
        return getCost(dp, cost, n);
    }
    
    int getCost(Integer[] dp, int[] cost, int n) {
        if(n >= 0 && dp[n] != null) {
            return (int)dp[n];
        }
        
        dp[n] = Math.min(getCost(dp, cost, n-1)+cost[n-1], getCost(dp, cost, n-2)+cost[n-2]);
        return dp[n];
    }