Package g2101_2200.s2181_merge_nodes_in_between_zeros

Class Solution

java.lang.Object
g2101_2200.s2181_merge_nodes_in_between_zeros.Solution
public class Solution extends Object
2181 - Merge Nodes in Between Zeros.<p>Medium</p> <p>You are given the <code>head</code> of a linked list, which contains a series of integers <strong>separated</strong> by <code>0</code>&rsquo;s. The <strong>beginning</strong> and <strong>end</strong> of the linked list will have <code>Node.val == 0</code>.</p> <p>For <strong>every</strong> two consecutive <code>0</code>&rsquo;s, <strong>merge</strong> all the nodes lying in between them into a single node whose value is the <strong>sum</strong> of all the merged nodes. The modified list should not contain any <code>0</code>&rsquo;s.</p> <p>Return <em>the</em> <code>head</code> <em>of the modified linked list</em>.</p> <p><strong>Example 1:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2022/02/02/ex1-1.png" alt="" /></p> <p><strong>Input:</strong> head = [0,3,1,0,4,5,2,0]</p> <p><strong>Output:</strong> [4,11]</p> <p><strong>Explanation:</strong></p> <p>The above figure represents the given linked list. The modified list contains</p> <ul> <li> <p>The sum of the nodes marked in green: 3 + 1 = 4.</p> </li> <li> <p>The sum of the nodes marked in red: 4 + 5 + 2 = 11.</p> </li> </ul> <p><strong>Example 2:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2022/02/02/ex2-1.png" alt="" /></p> <p><strong>Input:</strong> head = [0,1,0,3,0,2,2,0]</p> <p><strong>Output:</strong> [1,3,4]</p> <p><strong>Explanation:</strong></p> <p>The above figure represents the given linked list. The modified list contains</p> <ul> <li> <p>The sum of the nodes marked in green: 1 = 1.</p> </li> <li> <p>The sum of the nodes marked in red: 3 = 3.</p> </li> <li> <p>The sum of the nodes marked in yellow: 2 + 2 = 4.</p> </li> </ul> <p><strong>Constraints:</strong></p> <ul> <li>The number of nodes in the list is in the range <code>[3, 2 * 10<sup>5</sup>]</code>.</li> <li><code>0 <= Node.val <= 1000</code></li> <li>There are <strong>no</strong> two consecutive nodes with <code>Node.val == 0</code>.</li> <li>The <strong>beginning</strong> and <strong>end</strong> of the linked list have <code>Node.val == 0</code>.</li> </ul>

  • Constructor Details

    • Solution

      public Solution()

  • Method Details