题目描述
输入两个单调递增的链表,输出两个链表合成后的链表,当然我们需要合成后的链表满足单调不减规则。
代码实现
解法一:非递归
/*
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 newHead = new ListNode(-1);
ListNode current = newHead;
while(list1 != null && list2 != null){
if(list1.val <= list2.val){
current.next = list1;
list1 = list1.next;
}
else{
current.next = list2;
list2 = list2.next;
}
current = current.next;
}
if(list1 != null) current.next = list1;
if(list2 != null) current.next = list2;
return newHead.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;
if(list1.val <= list2.val){
list1.next = Merge(list1.next,list2);
return list1;
}
else{
list2.next = Merge(list2.next,list1);
return list2;
}
}
}