refactor 548

fishercoder1534 · fishercoder1534 · commit d4da2739c288 · 2017-09-04T09:16:17.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_548.java b/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;
                 }
             }

Original file line number	Diff line number	Diff line change
`@@ -41,11 +41,13 @@ public boolean splitArray(int[] nums) {`
`41`	`41`	`Set<Integer> set = new HashSet<>();`
`42`	`42`	`for (int i = 1; i < j - 1; i++) {`
`43`	`43`	`if (sum[i - 1] == sum[j - 1] - sum[i]) {`
	`44`	`+ /*this is sum(0, i-1) and sum(i+1, j-1)/`
`44`	`45`	`set.add(sum[i - 1]);`
`45`	`46`	`}`
`46`	`47`	`}`
`47`	`48`	`for (int k = j + 2; k < len - 1; k++) {`
`48`		`- if (sum[len - 1] - sum[k] == sum[k - 1] - sum[j] && set.contains(sum[k - 1] - sum[j])) {`
	`49`	`+ if (sum[k - 1] - sum[j] == sum[len - 1] - sum[k] && set.contains(sum[k - 1] - sum[j])) {`
	`50`	`+ /*this is sum(j+1, k-1) and sum(k+1, len-1)/`
`49`	`51`	`return true;`
`50`	`52`	`}`
`51`	`53`	`}`