题目描述
输入两个单调递增的链表,输出两个链表合成后的链表,当然我们需要合成后的链表满足单调不减规则。
java代码:
非递归版本:
/*
public class ListNode {
int val;
ListNode next = null;
ListNode(int val) {
this.val = val;
}
}*/
public class Solution {
public ListNode Merge(ListNode list1,ListNode list2) {
ListNode merge=new ListNode(0);
ListNode list = merge;
while(list1!=null&&list2!=null){
if(list1.val<list2.val){
merge.next = list1;
list1=list1.next;
merge=merge.next;
}else{
merge.next = list2;
list2=list2.next;
merge=merge.next;
}
}
if(list1==null){
while(list2!=null){
merge.next=list2;
list2=list2.next;
merge=merge.next;
}
}else{
while(list1!=null){
merge.next=list1;
list1=list1.next;
merge=merge.next;
}
}
return 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 merge = null;
if(list1.val<list2.val){
merge=list1;
merge.next = Merge(list1.next,list2);
}else{
merge = list2;
merge.next = Merge(list1,list2.next);
}
return merge;
}
}