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

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

public class Solution {
    public static ListNode removeElements(ListNode head, int val) {
    while(head!=null&&head.val==val){head=head.next;}
    if(head==null){return null;}
    ListNode pre_li=head;
    ListNode li=head.next;
    while(li!=null){
        if(li.val==val){pre_li.next=li.next;li=li.next;}
        else{pre_li=li;li=li.next;}
    }
    return head;
    }
    public static class ListNode {
    int val;
    ListNode next;

    ListNode(int x) {
        val = x;
    }
    }
    public static void main(String[]args){
    ListNode[]node=new ListNode[4];
    for(int i=0;i<node.length;i++){
        node[i]=new ListNode(1);
    }
    node[0].next=node[1];
    node[1].next=node[2];
    node[2].next=node[3];
    ListNode head=removeElements(node[0],1);
    while(head!=null){
        System.out.println(head.val);
        head=head.next;
    }
    }
}