2022-03-27 20:56:26 +08:00
< p > Given the < code > head< / code > of a linked list and an integer < code > val< / code > , remove all the nodes of the linked list that has < code > Node.val == val< / code > , and return < em > the new head< / em > .< / p >
< p > < / p >
2023-12-09 18:42:21 +08:00
< p > < strong class = "example" > Example 1:< / strong > < / p >
2022-03-27 20:56:26 +08:00
< img alt = "" src = "https://assets.leetcode.com/uploads/2021/03/06/removelinked-list.jpg" style = "width: 500px; height: 142px;" / >
< pre >
< strong > Input:< / strong > head = [1,2,6,3,4,5,6], val = 6
< strong > Output:< / strong > [1,2,3,4,5]
< / pre >
2023-12-09 18:42:21 +08:00
< p > < strong class = "example" > Example 2:< / strong > < / p >
2022-03-27 20:56:26 +08:00
< pre >
< strong > Input:< / strong > head = [], val = 1
< strong > Output:< / strong > []
< / pre >
2023-12-09 18:42:21 +08:00
< p > < strong class = "example" > Example 3:< / strong > < / p >
2022-03-27 20:56:26 +08:00
< pre >
< strong > Input:< / strong > head = [7,7,7,7], val = 7
< strong > Output:< / strong > []
< / pre >
< p > < / p >
< p > < strong > Constraints:< / strong > < / p >
< ul >
< li > The number of nodes in the list is in the range < code > [0, 10< sup > 4< / sup > ]< / code > .< / li >
< li > < code > 1 < = Node.val < = 50< / code > < / li >
< li > < code > 0 < = val < = 50< / code > < / li >
< / ul >