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

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 an array of integers <code>nums</code> and the <code>head</code> of a linked list. Return the <code>head</code> of the modified linked list after removing all nodes from the linked list that have a value that exists in <code>nums</code>.

&nbsp;
Example 1:

<div class="example-block">
Input: nums = [1,2,3], head = [1,2,3,4,5]

Output: [4,5]

Explanation:

<img alt="" src="https://assets.leetcode.com/uploads/2024/06/11/linkedlistexample0.png" style="width: 400px; height: 66px;" />

Remove the nodes with values 1, 2, and 3.
</div>

Example 2:

<div class="example-block">
Input: nums = [1], head = [1,2,1,2,1,2]

Output: [2,2,2]

Explanation:

<img alt="" src="https://assets.leetcode.com/uploads/2024/06/11/linkedlistexample1.png" style="height: 62px; width: 450px;" />

Remove the nodes with value 1.
</div>

Example 3:

<div class="example-block">
Input: nums = [5], head = [1,2,3,4]

Output: [1,2,3,4]

Explanation:

<img alt="" src="https://assets.leetcode.com/uploads/2024/06/11/linkedlistexample2.png" style="width: 400px; height: 83px;" />

No node has value 5.
</div>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= nums.length &lt;= 105</code></li>
	<li><code>1 &lt;= nums[i] &lt;= 105</code></li>
	<li>All elements in <code>nums</code> are unique.</li>
	<li>The number of nodes in the given list is in the range <code>[1, 105]</code>.</li>
	<li><code>1 &lt;= Node.val &lt;= 105</code></li>
	<li>The input is generated such that there is at least one node in the linked list that has a value not present in <code>nums</code>.</li>
</ul>

modifiedList

Delete Nodes From Linked List Present in Array

Remove Linked List Elements

remove-linked-list-elements

移除链表元素

Delete Node in a Linked List

delete-node-in-a-linked-list

删除链表中的节点

Remove Nodes From Linked List

remove-nodes-from-linked-list

从链表中移除节点

Array

Hash Table

Linked List

给你一个整数数组 <code>nums</code> 和一个链表的头节点 <code>head</code>。从链表中移除所有存在于 <code>nums</code> 中的节点后，返回修改后的链表的头节点。

&nbsp;

示例 1：

<div class="example-block">
输入： nums = [1,2,3], head = [1,2,3,4,5]

输出： [4,5]

解释：

<img alt="" src="https://assets.leetcode.com/uploads/2024/06/11/linkedlistexample0.png" style="width: 400px; height: 66px;" />

移除数值为 1, 2 和 3 的节点。
</div>

示例 2：

<div class="example-block">
输入： nums = [1], head = [1,2,1,2,1,2]

输出： [2,2,2]

解释：

<img alt="" src="https://assets.leetcode.com/uploads/2024/06/11/linkedlistexample1.png" style="height: 62px; width: 450px;" />

移除数值为 1 的节点。
</div>

示例 3：

<div class="example-block">
输入： nums = [5], head = [1,2,3,4]

输出： [1,2,3,4]

解释：

<img alt="" src="https://assets.leetcode.com/uploads/2024/06/11/linkedlistexample2.png" style="width: 400px; height: 83px;" />

链表中不存在值为 5 的节点。
</div>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= nums.length &lt;= 105</code></li>
	<li><code>1 &lt;= nums[i] &lt;= 105</code></li>
	<li><code>nums</code> 中的所有元素都是唯一的。</li>
	<li>链表中的节点数在 <code>[1, 105]</code> 的范围内。</li>
	<li><code>1 &lt;= Node.val &lt;= 105</code></li>
	<li>输入保证链表中至少有一个值没有在&nbsp;<code>nums</code> 中出现过。</li>
</ul>