Package g3201_3300.s3217_delete_nodes_from_linked_list_present_in_array

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    3217 - Delete Nodes From Linked List Present in Array.

    Medium

    You are given an array of integers nums and the head of a linked list. Return the head of the modified linked list after removing all nodes from the linked list that have a value that exists in nums.

    Example 1:

    Input: nums = 1,2,3, head = 1,2,3,4,5

    Output: 4,5

    Explanation:

    Remove the nodes with values 1, 2, and 3.

    Example 2:

    Input: nums = 1, head = 1,2,1,2,1,2

    Output: 2,2,2

    Explanation:

    Remove the nodes with value 1.

    Example 3:

    Input: nums = 5, head = 1,2,3,4

    Output: 1,2,3,4

    Explanation:

    No node has value 5.

    Constraints:

    • <code>1 <= nums.length <= 10<sup>5</sup></code>

    • <code>1 <= numsi<= 10<sup>5</sup></code>

    • All elements in nums are unique.

    • The number of nodes in the given list is in the range <code>1, 10<sup>5</sup></code>.

    • <code>1 <= Node.val <= 10<sup>5</sup></code>

    • The input is generated such that there is at least one node in the linked list that has a value not present in nums.

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final ListNode modifiedList(IntArray nums, ListNode head)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait