LeetCode-203.Remove Linked List Elements

https://leetcode.com/problems/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 {
 *     public int val;
 *     public ListNode next;
 *     public ListNode(int x) { val = x; }
 * }
 */
public class Solution 
{
    public ListNode RemoveElements(ListNode head, int val) 
    {
        if(head==null)
            return null;
        ListNode pre=new ListNode(0),node;
        pre.next=head;
        node=pre;
        while(head!=null)
        {
            if(head.val==val)
            {
                while(head!=null&&head.val==val)
                    head=head.next;
                node.next=head;
            }
            else
            {
                node=head;
                head=head.next;
            }
        }
        return pre.next;
    }
}