refactor 120

fishercoder1534 · fishercoder1534 · commit a0de0946fd0a · 2020-05-12T07:51:38.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_120.java b/src/main/java/com/fishercoder/solutions/_120.java
@@ -2,38 +2,21 @@
 
 import java.util.List;
 
-/**
- * 120. Triangle
-
-  Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.
-
- For example, given the following triangle
- [
- [2],
- [3,4],
- [6,5,7],
- [4,1,8,3]
- ]
- The minimum path sum from top to bottom is 11 (i.e., 2 + 3 + 5 + 1 = 11).
-
- Note:
- Bonus point if you are able to do this using only O(n) extra space, where n is the total number of rows in the triangle.*/
-
 public class _120 {
-  public static class Solution1 {
-    public int minimumTotal(List<List<Integer>> triangle) {
-      int n = triangle.size();
-      List<Integer> cache = triangle.get(n - 1);
+    public static class Solution1 {
+        public int minimumTotal(List<List<Integer>> triangle) {
+            int n = triangle.size();
+            List<Integer> cache = triangle.get(n - 1);
 
-      for (int layer = n - 2; layer >= 0; layer--) {
-        //for each layer
-        for (int i = 0; i <= layer; i++) {
-          //check its very node
-          int value = Math.min(cache.get(i), cache.get(i + 1)) + triangle.get(layer).get(i);
-          cache.set(i, value);
+            for (int layer = n - 2; layer >= 0; layer--) {
+                //for each layer
+                for (int i = 0; i <= layer; i++) {
+                    //check its very node
+                    int value = Math.min(cache.get(i), cache.get(i + 1)) + triangle.get(layer).get(i);
+                    cache.set(i, value);
+                }
+            }
+            return cache.get(0);
         }
-      }
-      return cache.get(0);
     }
-  }
 }
