203. Remove Linked List Elements

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

 

public class Solution {
    public ListNode removeElements(ListNode head, int val) {
        ListNode fakeNode = new ListNode(-1);
        ListNode prev = fakeNode;
        ListNode curr = head;
        fakeNode.next = head;
        while (curr != null) {
            if (curr.val == val) {
               prev.next = curr.next;
            }else {
                prev = prev.next;
            }
            curr = curr.next;
        }
        return fakeNode.next;
    }
}