/*
public class ListNode {
int val;
ListNode next = null;
ListNode(int val) {
this.val = val;
}
}*/
public class Solution {
public ListNode Merge(ListNode list1,ListNode list2) {
if(list1 == null){
return list2;
}
if(list2 == null){
return list1;
}
//新建一个头节点,用来存合并的链表。
ListNode res = new ListNode(-1);
res.next = null;
ListNode head = res;
while(list1!=null&list2!=null){
if(list1.val<list2.val){
head.next = list1;
list1 = list1.next;
head = head.next;
}else{
head.next = list2;
list2 = list2.next;
head = head.next;
}
}
if(list1!=null){
head.next = list1;
}
if(list2!=null){
head.next = list2;
}
return res.next;
}
}