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

/*
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 newList = new ListNode(-1);//头结点
        ListNode temp = newList;
        while(list1 != null && list2 != null){
          if(list1.val <= list2.val){
            temp.next = list1;
            temp = list1;
            list1 = list1.next;
          }else {
            temp.next = list2;
            temp = list2;
            list2 = list2.next;
          }
        }
        temp.next = list1 != null ? list1 : list2;
        return newList.next;
    }
}