Leetcode 746. Min Cost Climbing Stairs

 

思路：动态规划。

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

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

转载于:https://www.cnblogs.com/Deribs4/p/8330522.html

总结

以上是生活随笔为你收集整理的Leetcode 746. Min Cost Climbing Stairs的全部内容，希望文章能够帮你解决所遇到的问题。

如果觉得生活随笔网站内容还不错，欢迎将生活随笔推荐给好友。