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

Solution:

/**
 * 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 rt = new ListNode(0), pre, now = head;
        rt.next = head; pre = rt;
        while(now !=null){
            if(now.val == val) {pre.next = now.next; now = now.next; }
            else {pre = now; now = now.next;}
        }
        return rt.next;
    }
}