题解 | #合并两个排序的链表#

/*
public class ListNode {
    int val;
    ListNode next = null;

    ListNode(int val) {
        this.val = val;
    }
}*/
public class Solution {
    public ListNode Merge(ListNode list1,ListNode list2) {
        ListNode dummy = new ListNode(-1);
        ListNode cur = dummy, head1 = list1, head2 = list2;
        while(head1 != null && head2 != null){
            if(head1.val < head2.val){
                cur.next = head1;
                cur = head1;
                head1 = head1.next;
            }else{
                cur.next = head2;
                cur = head2;
                head2 = head2.next;
            }
        }

        if(head1 != null){
            cur.next = head1;
        }
        if(head2 != null){
            cur.next = head2;
        }

        return dummy.next;
        
    }
}