思路:線性規劃,遍歷兩個鏈表,比較表頭的值,小的一方剔除出下次遍歷
代碼:
/*
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 temp3 = null;
if(list1.val > list2.val){
temp3 = list2;
temp3.next = Merge(list1,list2.next);
}else{
temp3 = list1;
temp3.next = Merge(list1.next,list2);
}
return temp3;
}
}
end