mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 11:43:12 +08:00
34 lines
1.2 KiB
HTML
34 lines
1.2 KiB
HTML
<p>You are given the <code>head</code> of a linked list.</p>
|
|
|
|
<p>Remove every node which has a node with a <strong>strictly greater</strong> value anywhere to the right side of it.</p>
|
|
|
|
<p>Return <em>the </em><code>head</code><em> of the modified linked list.</em></p>
|
|
|
|
<p> </p>
|
|
<p><strong class="example">Example 1:</strong></p>
|
|
<img alt="" src="https://assets.leetcode.com/uploads/2022/10/02/drawio.png" style="width: 631px; height: 51px;" />
|
|
<pre>
|
|
<strong>Input:</strong> head = [5,2,13,3,8]
|
|
<strong>Output:</strong> [13,8]
|
|
<strong>Explanation:</strong> The nodes that should be removed are 5, 2 and 3.
|
|
- Node 13 is to the right of node 5.
|
|
- Node 13 is to the right of node 2.
|
|
- Node 8 is to the right of node 3.
|
|
</pre>
|
|
|
|
<p><strong class="example">Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> head = [1,1,1,1]
|
|
<strong>Output:</strong> [1,1,1,1]
|
|
<strong>Explanation:</strong> Every node has value 1, so no nodes are removed.
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li>The number of the nodes in the given list is in the range <code>[1, 10<sup>5</sup>]</code>.</li>
|
|
<li><code>1 <= Node.val <= 10<sup>5</sup></code></li>
|
|
</ul>
|