[LeetCode Sync] Runtime - 60 ms (48.37%), Memory - 58.8 MB (22.26%)

Author: NinePiece2

Solutions/3501-delete-nodes-from-linked-list-present-in-array/README.md

@@ -0,0 +1,56 @@
+<p>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 <strong>removing</strong> all nodes from the linked list that have a value that exists in <code>nums</code>.</p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<div class="example-block">
+<p><strong>Input:</strong> <span class="example-io">nums = [1,2,3], head = [1,2,3,4,5]</span></p>
+
+<p><strong>Output:</strong> <span class="example-io">[4,5]</span></p>
+
+<p><strong>Explanation:</strong></p>
+
+<p><strong><img alt="" src="https://assets.leetcode.com/uploads/2024/06/11/linkedlistexample0.png" style="width: 400px; height: 66px;" /></strong></p>
+
+<p>Remove the nodes with values 1, 2, and 3.</p>
+</div>
+
+<p><strong class="example">Example 2:</strong></p>
+
+<div class="example-block">
+<p><strong>Input:</strong> <span class="example-io">nums = [1], head = [1,2,1,2,1,2]</span></p>
+
+<p><strong>Output:</strong> <span class="example-io">[2,2,2]</span></p>
+
+<p><strong>Explanation:</strong></p>
+
+<p><img alt="" src="https://assets.leetcode.com/uploads/2024/06/11/linkedlistexample1.png" style="height: 62px; width: 450px;" /></p>
+
+<p>Remove the nodes with value 1.</p>
+</div>
+
+<p><strong class="example">Example 3:</strong></p>
+
+<div class="example-block">
+<p><strong>Input:</strong> <span class="example-io">nums = [5], head = [1,2,3,4]</span></p>
+
+<p><strong>Output:</strong> <span class="example-io">[1,2,3,4]</span></p>
+
+<p><strong>Explanation:</strong></p>
+
+<p><strong><img alt="" src="https://assets.leetcode.com/uploads/2024/06/11/linkedlistexample2.png" style="width: 400px; height: 83px;" /></strong></p>
+
+<p>No node has value 5.</p>
+</div>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>1 &lt;= nums.length &lt;= 10<sup>5</sup></code></li>
+	<li><code>1 &lt;= nums[i] &lt;= 10<sup>5</sup></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, 10<sup>5</sup>]</code>.</li>
+	<li><code>1 &lt;= Node.val &lt;= 10<sup>5</sup></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>

Solutions/3501-delete-nodes-from-linked-list-present-in-array/solution.py

@@ -0,0 +1,15 @@
+# Definition for singly-linked list.
+# class ListNode:
+#     def __init__(self, val=0, next=None):
+#         self.val = val
+#         self.next = next
+class Solution:
+    def modifiedList(self, nums: List[int], head: Optional[ListNode]) -> Optional[ListNode]:
+        set_nums = set(nums)
+        dummy = last = ListNode(next=head)
+        while last.next:
+            if last.next.val in set_nums:
+                last.next = last.next.next
+            else:
+                last = last.next
+        return dummy.next