refactor 548

fishercoder1534 · fishercoder1534 · commit d8b16eb50da0 · 2020-07-16T17:18:10.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_548.java b/src/main/java/com/fishercoder/solutions/_548.java
@@ -3,28 +3,6 @@
 import java.util.HashSet;
 import java.util.Set;
 
-/**
- * 548. Split Array with Equal Sum
- *
- * Given an array with n integers, you need to find if there are triplets (i, j, k) which satisfies following conditions:
- * 0 < i, i + 1 < j, j + 1 < k < n - 1
- * Sum of subarrays (0, i - 1), (i + 1, j - 1), (j + 1, k - 1) and (k + 1, n - 1) should be equal.
- * where we define that subarray (L, R) represents a slice of the original array starting from the element indexed L to the element indexed R.
-
- Example:
- Input: [1,2,1,2,1,2,1]
- Output: True
- Explanation:
- i = 1, j = 3, k = 5.
- sum(0, i - 1) = sum(0, 0) = 1
- sum(i + 1, j - 1) = sum(2, 2) = 1
- sum(j + 1, k - 1) = sum(4, 4) = 1
- sum(k + 1, n - 1) = sum(6, 6) = 1
-
- Note:
- 1 <= n <= 2000.
- Elements in the given array will be in range [-1,000,000, 1,000,000].
- */
 public class _548 {
 
     public static class Solution1 {
