考虑递归,listnode的两个方法,list.val和list.next.
用图解释:
/*
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 mergelist=null;
if(list1.val<=list2.val){
mergelist=list1;
mergelist.next=Merge(list1.next,list2);
return mergelist;
}
if(list1.val>list2.val){
mergelist=list2;
mergelist.next=Merge(list1,list2.next);
return mergelist;
}
return mergelist;
}
}