Update Solution2.java

Author: yanglbme

solution/0700-0799/0746.Min Cost Climbing Stairs/Solution2.java

@@ -1,11 +1,10 @@
 class Solution {
     public int minCostClimbingStairs(int[] cost) {
-        int f = 0, g = 0;
-        for (int i = 2; i <= cost.length; ++i) {
-            int gg = Math.min(f + cost[i - 2], g + cost[i - 1]);
-            f = g;
-            g = gg;
+        int n = cost.length;
+        int[] f = new int[n + 1];
+        for (int i = 2; i <= n; ++i) {
+            f[i] = Math.min(f[i - 2] + cost[i - 2], f[i - 1] + cost[i - 1]);
         }
-        return g;
+        return f[n];
     }
-}
+}