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
[0, 104]
. 1 <= Node.val <= 50
0 <= val <= 50
class Solution:
def removeElements(self, head:ListNode, val:int)->ListNode:
while head != None and head.val == val:
head = head.next
if head is None:
return None
ptr = head
while ptr and ptr.next:
while ptr.next != None and ptr.next.val == val:
temp = ptr.next
ptr.next = temp.next
ptr = ptr.next
return head