题目描述
输入两个单调递增的链表,输出两个链表合成后的链表,当然我们需要合成后的链表满足单调不减规则。
解题思路
两种解法:递归和非递归
//递归
public ListNode merge(ListNode list1,ListNode list2){
if(list1 == null)
return list2;
else if(list2 == null)
return list1;
ListNode mergeHead = null;
if(list1.val <= list2.val){
mergeHead = list1;
mergeHead.next = merge(list1.next, list2);
}else{
mergeHead = list2;
mergeHead.next = merge(list1, list2.next);
}
return mergeHead;
}
//非递归
public ListNode merge2(ListNode list1,ListNode list2){
if(list1 == null)
return list2;
else if(list2 == null)
return list1;
ListNode mergeHead = null;
if(list1.val <= list2.val){
mergeHead = list1;
list1 = list1.next;
}else{
mergeHead = list2;
list2 = list2.next;
}
ListNode cur = mergeHead;
while(list1 != null && list2 != null){
if(list1.val <= list2.val){
cur.next = list1;
list1 = list1.next;
}else{
cur.next = list2;
list2 = list2.next;
}
cur = cur.next;
}
if(list1 == null)
cur.next = list2;
else if(list2 == null)
cur.next = list1;
return mergeHead;
}