Merge Two Sorted Lists

https://leetcode.com/problems/merge-two-sorted-lists/

Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.

public class Solution {
    public static ListNode mergeTwoLists(ListNode l1, ListNode l2) {
        if(l1==null){return l2;}
        if(l2==null){return l1;}
        ListNode head=new ListNode(0);
        ListNode list1=l1;
        ListNode list2=l2;
        if(list1.val<=list2.val){head.next=l1;list1=list1.next;}
        else{head.next=list2;list2=list2.next;}
        ListNode list=head.next;
        while(list1!=null&&list2!=null){
            if(list1.val<=list2.val){list.next=list1;list=list.next;list1=list1.next;}
            else{list.next=list2;list=list.next;list2=list2.next;}
        }
        if(list1==null){list.next=list2;}
        else if(list2==null){list.next=list1;}
        return head.next;
    }
    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(i+2);
    }
    node[0].next=node[1];
    node[1].next=node[2];
    node[2].next=node[3];
    ListNode node1=new ListNode(0);
    ListNode node2=new ListNode(6);
    node1.next=node2;
    ListNode head=mergeTwoLists(node[0],node1);
    while(head!=null){
        System.out.println(head.val);
        head=head.next;
    }
    }
}