LeetCode-21.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.

Example:

Input: 1->2->4, 1->3->4
Output: 1->1->2->3->4->4

public ListNode mergeTwoLists(ListNode l1, ListNode l2) {//链表 my
        ListNode node = new ListNode(0);
        ListNode curr= node;
        while(null!=l1&&null!=l2){
            if(l1.val<l2.val){
                curr.next=l1;
                l1=l1.next;
                curr=curr.next;
                curr.next=null;
            }
            else{
                curr.next=l2;
                l2=l2.next;
                curr=curr.next;
                curr.next=null;
            }
        }
        if (null!=l1){
            curr.next=l1;
        }
        else{
            curr.next=l2;
        }
        return node.next;
    }