| [ Web Proxy ] |
| Viewing: https://raw.githubusercontent.com/feixiangcode/algorithm/master/Week_04/id_1/LeetCode_746_1.java | [Back] [Original] |
//
// class Solution {
// private int[] cost;
// public int minCostClimbingStairs(int[] cost) {
// this.cost = cost;
// int len = cost.length;
// return Math.min(minCost(len-1), minCost(len-2));
// }
// public int minCost(int n) {
// if (n
| Web Proxy Viewer | New URL | Original Page |