Leetcode 746. Min Cost Climbing Stairs

思路：动态规划。

 class Solution {
     //不能对cost数组进行写操作，因为JAVA中参数是引用
     public int minCostClimbingStairs(int[] cost) {
         int cost_0 = cost[0], cost_1 = cost[1];
         for(int i = 2; i < cost.length; i++) {
             int cost_2 = Math.min(cost_0, cost_1) + cost[i];
             cost_0 = cost_1;
             cost_1 = cost_2;
         }
         return Math.min(cost_0, cost_1);
     }
 }

Next challenges: Paint Fence Coin Change Maximum Sum of 3 Non-Overlapping Subarrays