aeonve
diff --git a/‎src/main/java/com/fishercoder/solutions/_548.java
Lines changed: 24 additions & 22 deletions b/‎src/main/java/com/fishercoder/solutions/_548.java
Lines changed: 24 additions & 22 deletions
diff --git a/‎src/test/java/com/fishercoder/_548Test.java
Lines changed: 2 additions & 2 deletions b/‎src/test/java/com/fishercoder/_548Test.java
Lines changed: 2 additions & 2 deletions
@@ -27,32 +27,34 @@
  */
 public class _548 {
 
-    public boolean splitArray(int[] nums) {
-        int len = nums.length;
-        if (len < 7) {
-            return false;
-        }
-        int[] sum = new int[len];
-        sum[0] = nums[0];
-        for (int i = 1; i < len; i++) {
-            sum[i] = sum[i - 1] + nums[i];
-        }
-        for (int j = 3; j < len - 3; j++) {
-            Set<Integer> set = new HashSet<>();
-            for (int i = 1; i < j - 1; i++) {
-                if (sum[i - 1] == sum[j - 1] - sum[i]) {
-                    /**this is sum(0, i-1) and sum(i+1, j-1)*/
-                    set.add(sum[i - 1]);
-                }
+    public static class Solution1 {
+        public boolean splitArray(int[] nums) {
+            int len = nums.length;
+            if (len < 7) {
+                return false;
             }
-            for (int k = j + 2; k < len - 1; k++) {
-                if (sum[k - 1] - sum[j] == sum[len - 1] - sum[k] && set.contains(sum[k - 1] - sum[j])) {
-                    /**this is sum(j+1, k-1) and sum(k+1, len-1)*/
-                    return true;
+            int[] sum = new int[len];
+            sum[0] = nums[0];
+            for (int i = 1; i < len; i++) {
+                sum[i] = sum[i - 1] + nums[i];
+            }
+            for (int j = 3; j < len - 3; j++) {
+                Set<Integer> set = new HashSet<>();
+                for (int i = 1; i < j - 1; i++) {
+                    if (sum[i - 1] == sum[j - 1] - sum[i]) {
+                        /**this is sum(0, i-1) and sum(i+1, j-1)*/
+                        set.add(sum[i - 1]);
+                    }
+                }
+                for (int k = j + 2; k < len - 1; k++) {
+                    if (sum[k - 1] - sum[j] == sum[len - 1] - sum[k] && set.contains(sum[k - 1] - sum[j])) {
+                        /**this is sum(j+1, k-1) and sum(k+1, len-1)*/
+                        return true;
+                    }
                 }
             }
+
return false;            return false;
         }
-        return false;
     }
 
 }
@@ -8,14 +8,14 @@
 import static junit.framework.Assert.assertEquals;
 
 public class _548Test {
-    private static _548 test;
+    private static _548.Solution1 test;
     private static boolean expected;
     private static boolean actual;
     private static int[] nums;
 
     @BeforeClass
     public static void setup() {
-        test = new _548();
+        test = new _548.Solution1();
     }
 
     @Before