| [ Web Proxy ] |
| Viewing: https://raw.githubusercontent.com/mJackie/leetcode/master/code/lc746.java | [Back] [Original] |
package code;
/*
* 746. Min Cost Climbing Stairs
*
* Easy
* Array, Dynamic Programming
*
* TipsBingo!
*/
public class lc746 {
public int minCostClimbingStairs(int[] cost) {
if(cost.length==1) return cost[0];
int dp1 = cost[0], dp2 = cost[1], dp3 = Integer.MAX_VALUE;
for(int i=2; i
| Web Proxy Viewer | New URL | Original Page |