refactor 746

fishercoder1534 · fishercoder1534 · commit 61d3a73d69ca · 2020-07-22T15:53:11.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_746.java b/src/main/java/com/fishercoder/solutions/_746.java
@@ -1,37 +1,15 @@
 package com.fishercoder.solutions;
 
-/**
- * 746. Min Cost Climbing Stairs
- *
- * On a staircase, the i-th step has some non-negative cost cost[i] assigned (0 indexed).
- * Once you pay the cost, you can either climb one or two steps.
- * You need to find minimum cost to reach the top of the floor, and you can either start from the step with index 0, or the step with index 1.
-
- Example 1:
- Input: cost = [10, 15, 20]
- Output: 15
- Explanation: Cheapest is start on cost[1], pay that cost and go to the top.
-
- Example 2:
- Input: cost = [1, 100, 1, 1, 1, 100, 1, 1, 100, 1]
- Output: 6
- Explanation: Cheapest is start on cost[0], and only step on 1s, skipping cost[3].
-
- Note:
- cost will have a length in the range [2, 1000].
- Every cost[i] will be an integer in the range [0, 999].
- */
-
 public class _746 {
-  public static class Solution1 {
-    public int minCostClimbingStairs(int[] cost) {
-      int[] dp = new int[cost.length];
-      dp[0] = cost[0];
-      dp[1] = cost[1];
-      for (int i = 2; i < cost.length; i++) {
-        dp[i] = Math.min(dp[i - 1] + cost[i], dp[i - 2] + cost[i]);
-      }
-      return Math.min(dp[cost.length - 1], dp[cost.length - 2]);
+    public static class Solution1 {
+        public int minCostClimbingStairs(int[] cost) {
+            int[] dp = new int[cost.length];
+            dp[0] = cost[0];
+            dp[1] = cost[1];
+            for (int i = 2; i < cost.length; i++) {
+                dp[i] = Math.min(dp[i - 1] + cost[i], dp[i - 2] + cost[i]);
+            }
+            return Math.min(dp[cost.length - 1], dp[cost.length - 2]);
+        }
     }
-  }
 }
