remove-zero-sum-consecutive-nodes-from-linked-list

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given the <code>head</code> of a linked list, we repeatedly delete consecutive sequences of nodes that sum to <code>0</code> until there are no such sequences.

After doing so, return the head of the final linked list.&nbsp; You may return any such answer.

&nbsp;
(Note that in the examples below, all sequences are serializations of <code>ListNode</code> objects.)

Example 1:

<pre>
Input: head = [1,2,-3,3,1]
Output: [3,1]
Note: The answer [1,2,1] would also be accepted.
</pre>

Example 2:

<pre>
Input: head = [1,2,3,-3,4]
Output: [1,2,4]
</pre>

Example 3:

<pre>
Input: head = [1,2,3,-3,-2]
Output: [1]
</pre>

&nbsp;
Constraints:

<ul>
	<li>The given linked list will contain between <code>1</code> and <code>1000</code> nodes.</li>
	<li>Each node in the linked list has <code>-1000 &lt;= node.val &lt;= 1000</code>.</li>
</ul>

removeZeroSumSublists

Remove Zero Sum Consecutive Nodes from Linked List

Delete N Nodes After M Nodes of a Linked List

delete-n-nodes-after-m-nodes-of-a-linked-list

删除链表 M 个节点之后的 N 个节点

Hash Table

Linked List

给你一个链表的头节点&nbsp;<code>head</code>，请你编写代码，反复删去链表中由 总和&nbsp;值为 <code>0</code> 的连续节点组成的序列，直到不存在这样的序列为止。

删除完毕后，请你返回最终结果链表的头节点。

&nbsp;

你可以返回任何满足题目要求的答案。

（注意，下面示例中的所有序列，都是对&nbsp;<code>ListNode</code>&nbsp;对象序列化的表示。）

示例 1：

<pre>输入：head = [1,2,-3,3,1]
输出：[3,1]
提示：答案 [1,2,1] 也是正确的。
</pre>

示例 2：

<pre>输入：head = [1,2,3,-3,4]
输出：[1,2,4]
</pre>

示例 3：

<pre>输入：head = [1,2,3,-3,-2]
输出：[1]
</pre>

&nbsp;

提示：

<ul>
	<li>给你的链表中可能有 <code>1</code> 到&nbsp;<code>1000</code>&nbsp;个节点。</li>
	<li>对于链表中的每个节点，节点的值：<code>-1000 &lt;= node.val &lt;= 1000</code>.</li>
</ul>