8000
We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent e9bf839 commit d4da273Copy full SHA for d4da273
src/main/java/com/fishercoder/solutions/_548.java
@@ -41,11 +41,13 @@ public boolean splitArray(int[] nums) {
41
Set<Integer> set = new HashSet<>();
42
for (int i = 1; i < j - 1; i++) {
43
if (sum[i - 1] == sum[j - 1] - sum[i]) {
44
+ /**this is sum(0, i-1) and sum(i+1, j-1)*/
45
set.add(sum[i - 1]);
46
}
47
48
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])) {
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)*/
51
return true;
52
53
0 commit comments