| [ Web Proxy ] |
| Viewing: https://raw.githubusercontent.com/isnotnull/algorithm/master/Week_04/id_115/leetcode_746_115.java | [Back] [Original] |
class Solution {
public int minCostClimbingStairs(int[] cost) {
int[] f = new int[cost.length + 1];//
f[0] = 0;
f[1] = 0;
for (int i = 2; i
| Web Proxy Viewer | New URL | Original Page |