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

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