8000 refactor 548 · codingwhite/Leetcode-4@d4da273 · GitHub
[go: up one dir, main page]

Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Commit d4da273

Browse files
refactor 548
1 parent e9bf839 commit d4da273

File tree

1 file changed

+3
-1
lines changed
  • src/main/java/com/fishercoder/solutions

1 file changed

+3
-1
lines changed

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

Lines changed: 3 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -41,11 +41,13 @@ public boolean splitArray(int[] nums) {
4141
Set<Integer> set = new HashSet<>();
4242
for (int i = 1; i < j - 1; i++) {
4343
if (sum[i - 1] == sum[j - 1] - sum[i]) {
44+
/**this is sum(0, i-1) and sum(i+1, j-1)*/
4445
set.add(sum[i - 1]);
4546
}
4647
}
4748
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)*/
4951
return true;
5052
}
5153
}

0 commit comments

Comments
 (0)
0