Skip to content

Commit c0bd347

Browse files
authored
Update Remove Zero Sum Consecutive Nodes from Linked List.java
1 parent 6a885d7 commit c0bd347

File tree

1 file changed

+19
-20
lines changed

1 file changed

+19
-20
lines changed

Medium/Remove Zero Sum Consecutive Nodes from Linked List.java

Lines changed: 19 additions & 20 deletions
Original file line numberDiff line numberDiff line change
@@ -9,25 +9,24 @@
99
* }
1010
*/
1111
class Solution {
12-
public ListNode removeZeroSumSublists(ListNode head) {
13-
ListNode dummy = new ListNode(0);
14-
ListNode curr = head;
15-
dummy.next = head;
16-
Map<Integer, ListNode> map = new HashMap<>();
17-
int prefixSum = 0;
18-
map.put(0, dummy);
19-
while (curr != null) {
20-
prefixSum += curr.val;
21-
map.put(prefixSum, curr);
22-
curr = curr.next;
12+
public ListNode removeZeroSumSublists(ListNode head) {
13+
ListNode dummy = new ListNode(0, head);
14+
ListNode curr = dummy;
15+
int prefixSum = 0;
16+
Map<Integer, ListNode> map = new HashMap<>();
17+
map.put(0, curr);
18+
while (curr != null) {
19+
prefixSum += curr.val;
20+
map.put(prefixSum, curr);
21+
curr = curr.next;
22+
}
23+
prefixSum = 0;
24+
curr = dummy;
25+
while (curr != null) {
26+
prefixSum += curr.val;
27+
curr.next = map.get(prefixSum).next;
28+
curr = curr.next;
29+
}
30+
return dummy.next;
2331
}
24-
prefixSum = 0;
25-
curr = dummy;
26-
while (curr != null) {
27-
prefixSum += curr.val;
28-
curr.next = map.get(prefixSum).next;
29-
curr = curr.next;
30-
}
31-
return dummy.next;
32-
}
3332
}

0 commit comments

Comments
 (0)