remove-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

You are given the <code>head</code> of a linked list.

Remove every node which has a node with a greater value anywhere to the right side of it.

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

&nbsp;
Example 1:
<img alt="" src="https://assets.leetcode.com/uploads/2022/10/02/drawio.png" style="width: 631px; height: 51px;" />
<pre>
Input: head = [5,2,13,3,8]
Output: [13,8]
Explanation: 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>

Example 2:

<pre>
Input: head = [1,1,1,1]
Output: [1,1,1,1]
Explanation: Every node has value 1, so no nodes are removed.
</pre>

&nbsp;
Constraints:

<ul>
	<li>The number of the nodes in the given list is in the range <code>[1, 105]</code>.</li>
	<li><code>1 &lt;= Node.val &lt;= 105</code></li>
</ul>

removeNodes

Remove Nodes From Linked List

Reverse Linked List

reverse-linked-list

反转链表

Delete Node in a Linked List

delete-node-in-a-linked-list

删除链表中的节点

Next Greater Element I

next-greater-element-i

下一个更大元素 I

Delete Nodes From Linked List Present in Array

delete-nodes-from-linked-list-present-in-array

从链表中移除在数组中存在的节点

Stack

Recursion

Linked List

Monotonic Stack

给你一个链表的头节点 <code>head</code> 。

移除每个右侧有一个更大数值的节点。

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

&nbsp;

示例 1：

<img alt="" src="https://assets.leetcode.com/uploads/2022/10/02/drawio.png" style="width: 631px; height: 51px;" />

<pre>
输入：head = [5,2,13,3,8]
输出：[13,8]
解释：需要移除的节点是 5 ，2 和 3 。
- 节点 13 在节点 5 右侧。
- 节点 13 在节点 2 右侧。
- 节点 8 在节点 3 右侧。
</pre>

示例 2：

<pre>
输入：head = [1,1,1,1]
输出：[1,1,1,1]
解释：每个节点的值都是 1 ，所以没有需要移除的节点。
</pre>

&nbsp;

提示：

<ul>
	<li>给定列表中的节点数目在范围 <code>[1, 105]</code> 内</li>
	<li><code>1 &lt;= Node.val &lt;= 105</code></li>
</ul>