/*
public class ListNode {
int val;
ListNode next = null;
ListNode(int val) {
this.val = val;
}
}*/
public class Solution {
public ListNode Merge(ListNode list1,ListNode list2) {
//1-->3-->6
//2-->4-->5
//链表list1,list2.判断1和2的头节点val哪个大。
if(list1 == null) return list2;
if(list2 == null) return list1;
ListNode head = null;
if(list1.val <= list2.val){
head = list1;
head.next = Merge(list1.next,list2);
}else{
head = list2;
head.next = Merge(list1,list2.next);
}
return head;
}
}