import java.util.*;

/*
 * public class ListNode {
 *   int val;
 *   ListNode next = null;
 *   public ListNode(int val) {
 *     this.val = val;
 *   }
 * }
 */

public class Solution {
    /**
     * 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可
     *
     * 
     * @param head ListNode类 
     * @param val int整型 
     * @return ListNode类
     */
    public ListNode deleteNode (ListNode head, int val) {
        // write code here
        ListNode tmp = head;
        Queue<ListNode> queue = new LinkedList<>();
        while (null != tmp) {
            if (tmp.val != val) {
                queue.add(tmp);
            }
            tmp = tmp.next;
        }
        if (queue.isEmpty()) {
            return null;
        }
        head = queue.poll();
        tmp = head;
        while (!queue.isEmpty()) {
            tmp.next = queue.poll();
            tmp = tmp.next;
        }
        tmp.next = null;
        return head;
    }
}