Problem
Given thehead 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.
Examples
Constraints
- The number of nodes in the list is in the range [0, 10<sup>4</sup>]
- 1 <= Node.val <= 50
- 0 <= val <= 50