Remove Linked List Elements

Easy

Given the head of a linked list and an integer k, remove all nodes whose value equals k and return the new head. (LeetCode calls this parameter val.)

Example 1

Input:  head = [1,2,6,3,4,5,6], k = 6
Output: [1,2,3,4,5]

Example 2

Input:  head = [7,7,7,7], k = 7
Output: []

Constraints

• 0 <= number of nodes <= 10^4
• 0 <= Node.val, k <= 50