refactor 548

Author: fishercoder1534

src/main/java/com/fishercoder/solutions/_548.java

@@ -41,11 +41,13 @@ public boolean splitArray(int[] nums) {
             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[len - 1] - sum[k] == sum[k - 1] - sum[j] && set.contains(sum[k - 1] - sum[j])) {
+                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;
                 }
             }