Given the head
of a linked list, we repeatedly delete consecutive sequences of nodes that sum to 0
until there are no such sequences.
After doing so, return the head of the final linked list. You may return any such answer.
(Note that in the examples below, all sequences are serializations of ListNode
objects.)
Example 1:
Input: head = [1,2,-3,3,1] Output: [3,1] Note: The answer [1,2,1] would also be accepted.
Example 2:
Input: head = [1,2,3,-3,4] Output: [1,2,4]
Example 3:
Input: head = [1,2,3,-3,-2] Output: [1]
Constraints:
- The given linked list will contain between
1
and1000
nodes. - Each node in the linked list has
-1000 <= node.val <= 1000
.
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution:
def removeZeroSumSublists(self, head: ListNode) -> ListNode:
dummy = ListNode(0)
dummy.next = head
s, cur = 0, dummy
pre_sum_node = {}
while cur:
s += cur.val
pre_sum_node[s] = cur
cur = cur.next
s, cur = 0, dummy
while cur:
s += cur.val
cur.next = pre_sum_node[s].next
cur = cur.next
return dummy.next
/**
* 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);
dummy.next = head;
Map<Integer, ListNode> preSumNode = new HashMap<>();
int s = 0;
for (ListNode cur = dummy; cur != null; cur = cur.next) {
s += cur.val;
preSumNode.put(s, cur);
}
s = 0;
for (ListNode cur = dummy; cur != null; cur = cur.next) {
s += cur.val;
cur.next = preSumNode.get(s).next;
}
return dummy.next;
}
}