Create Solution3.java

Author: yanglbme

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

@@ -0,0 +1,11 @@
+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;
+        }
+        return g;
+    }
+}