Package g0201_0300.s0203_remove_linked_list_elements

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    203 - Remove Linked List Elements.

    Easy

    Given the head of a linked list and an integer val, remove all the nodes of the linked list that has Node.val == val, and return the new head.

    Example 1:

    Input: head = 1,2,6,3,4,5,6, val = 6

    Output: 1,2,3,4,5

    Example 2:

    Input: head = [], val = 1

    Output: []

    Example 3:

    Input: head = 7,7,7,7, val = 7

    Output: []

    Constraints:

    • The number of nodes in the list is in the range <code>0, 10<sup>4</sup></code>.

    • 1 &lt;= Node.val &lt;= 50

    • 0 &lt;= val &lt;= 50

    • 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 removeElements(ListNode head, Integer val)

      • Methods inherited from class java.lang.Object

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