merge-nodes-in-between-zeros

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

You are given the <code>head</code> of a linked list, which contains a series of integers separated by <code>0</code>&#39;s. The beginning and end of the linked list will have <code>Node.val == 0</code>.

For every two consecutive <code>0</code>&#39;s, merge all the nodes lying in between them into a single node whose value is the sum of all the merged nodes. The modified list should not contain any <code>0</code>&#39;s.

Return the <code>head</code> of the modified linked list.

&nbsp;
Example 1:
<img alt="" src="https://assets.leetcode.com/uploads/2022/02/02/ex1-1.png" style="width: 600px; height: 41px;" />
<pre>
Input: head = [0,3,1,0,4,5,2,0]
Output: [4,11]
Explanation: 
The above figure represents the given linked list. The modified list contains
- The sum of the nodes marked in green: 3 + 1 = 4.
- The sum of the nodes marked in red: 4 + 5 + 2 = 11.
</pre>

Example 2:
<img alt="" src="https://assets.leetcode.com/uploads/2022/02/02/ex2-1.png" style="width: 600px; height: 41px;" />
<pre>
Input: head = [0,1,0,3,0,2,2,0]
Output: [1,3,4]
Explanation: 
The above figure represents the given linked list. The modified list contains
- The sum of the nodes marked in green: 1 = 1.
- The sum of the nodes marked in red: 3 = 3.
- The sum of the nodes marked in yellow: 2 + 2 = 4.
</pre>

&nbsp;
Constraints:

<ul>
	<li>The number of nodes in the list is in the range <code>[3, 2 * 105]</code>.</li>
	<li><code>0 &lt;= Node.val &lt;= 1000</code></li>
	<li>There are no two consecutive nodes with <code>Node.val == 0</code>.</li>
	<li>The beginning and end of the linked list have <code>Node.val == 0</code>.</li>
</ul>

mergeNodes

Merge Nodes in Between Zeros

Linked List Components

linked-list-components

链表组件

Linked List

Simulation

给你一个链表的头节点 <code>head</code> ，该链表包含由 <code>0</code> 分隔开的一连串整数。链表的 开端 和 末尾 的节点都满足 <code>Node.val == 0</code> 。

对于每两个相邻的 <code>0</code> ，请你将它们之间的所有节点合并成一个节点，其值是所有已合并节点的值之和。然后将所有 <code>0</code> 移除，修改后的链表不应该含有任何 <code>0</code> 。

&nbsp;返回修改后链表的头节点 <code>head</code> 。

&nbsp;

示例 1： 
<img alt="" src="https://assets.leetcode.com/uploads/2022/02/02/ex1-1.png" style="width: 600px; height: 41px;" />

<pre>
输入：head = [0,3,1,0,4,5,2,0]
输出：[4,11]
解释：
上图表示输入的链表。修改后的链表包含：
- 标记为绿色的节点之和：3 + 1 = 4
- 标记为红色的节点之和：4 + 5 + 2 = 11
</pre>

示例 2： 
<img alt="" src="https://assets.leetcode.com/uploads/2022/02/02/ex2-1.png" style="width: 600px; height: 41px;" />

<pre>
输入：head = [0,1,0,3,0,2,2,0]
输出：[1,3,4]
解释：
上图表示输入的链表。修改后的链表包含：
- 标记为绿色的节点之和：1 = 1
- 标记为红色的节点之和：3 = 3
- 标记为黄色的节点之和：2 + 2 = 4
</pre>

&nbsp;

提示：

<ul>
	<li>列表中的节点数目在范围 <code>[3, 2 * 105]</code> 内</li>
	<li><code>0 &lt;= Node.val &lt;= 1000</code></li>
	<li>不 存在连续两个&nbsp;<code>Node.val == 0</code> 的节点</li>
	<li>链表的 开端 和 末尾 节点都满足 <code>Node.val == 0</code></li>
</ul>