-
-
Notifications
You must be signed in to change notification settings - Fork 299
/
1171.java
37 lines (36 loc) · 1.19 KB
/
1171.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
__________________________________________________________________________________________________
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public ListNode removeZeroSumSublists(ListNode head) {
ListNode dummy = new ListNode(0), cur = dummy;
dummy.next = head;
int prefix = 0;
Map<Integer, ListNode> m = new HashMap<>();
while (cur != null) {
prefix += cur.val;
if (m.containsKey(prefix)) {
cur = m.get(prefix).next;
int p = prefix + cur.val;
while (p != prefix) {
m.remove(p);
cur = cur.next;
p += cur.val;
}
m.get(prefix).next = cur.next;
} else {
m.put(prefix, cur);
}
cur = cur.next;
}
return dummy.next;
}
}
__________________________________________________________________________________________________
__________________________________________________________________________________________________