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

/*
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 result = new ListNode(0);
        ListNode head = result;
        ListNode temp;
        while(!(list1==null || list2==null)){
            if(list1.val<=list2.val){
                temp = new ListNode(list1.val);
                list1 = list1.next;
            }
            else {
                temp = new ListNode(list2.val);
                list2 = list2.next;
            }
            result.next = temp;
            temp = temp.next;
            result = result.next;
        }
        if(list1!=null){
            while(list1!=null){
                temp = new ListNode(list1.val);
                list1 = list1.next;
                result.next = temp;
                temp = temp.next;
                result = result.next;
            }
        }
        else if(list2!=null){
            while(list2!=null){
                temp = new ListNode(list2.val);
                list2 = list2.next;
                result.next = temp;
                temp = temp.next;
                result = result.next;
            }
        }
        return head.next;
    }
}