Class Solution
-
- All Implemented Interfaces:
public final class Solution
203 - Remove Linked List Elements\.
Easy
Given the
head
of a linked list and an integerval
, remove all the nodes of the linked list that hasNode.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 <= Node.val <= 50
0 <= val <= 50
-
-
Constructor Summary
Constructors Constructor Description Solution()
-
Method Summary
Modifier and Type Method Description final ListNode
removeElements(ListNode head, Integer val)
-
-
Method Detail
-
removeElements
final ListNode removeElements(ListNode head, Integer val)
-
-
-
-