Remove Linked List Elements

Remove all elements from a linked list of integers that have value val.

Example
Given: 1 --> 2 --> 6 --> 3 --> 4 --> 5 --> 6, val = 6
Return: 1 --> 2 --> 3 --> 4 --> 5

Credits:
Special thanks to @mithmatt for adding this problem and creating all test cases.

Show Tags

Show Similar Problems

Have you met this question in a real interview? 

Tricky: When remove one node, we need to stay at the same position.

/** * Definition for singly-linked list. * public class ListNode { *     int val; *     ListNode next; *     ListNode(int x) { val = x; } * } */public class Solution {    public ListNode removeElements(ListNode head, int val) {        if(head == null)            return null;        ListNode newHead = new ListNode(0);        newHead.next = head;        ListNode cur = newHead;        while(cur.next != null){            if(cur.next.val == val){                cur.next = cur.next.next;            }else{                cur = cur.next;            }            if(cur == null)                break;        }        return newHead.next;    }}