题目描述:
将两个升序链表合并为一个新的 升序 链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。
示例1:
输入:l1 = [1,2,4], l2 = [1,3,4]
输出:[1,1,2,3,4,4]
示例2:
输入:l1 = [], l2 = []
输出:[]
示例3:
输入:l1 = [], l2 = [0]
输出:[0]
提示:
- 两个链表的节点数目范围是 [0, 50]
- 100 <= Node.val <= 100
- l1 和 l2 均按 非递减顺序 排列
迭代解法:
public class Solution {
public ListNode mergeTwoLists(ListNode list1, ListNode list2) {
ListNode fakeHead=new ListNode(-1);
ListNode head=fakeHead;
while (list1!=null&&list1!=null){
if (list1.val<= list2.val){
head.next=list1;
list1=list1.next;
}else {
head.next=list2;
list2=list2.next;
}
head=head.next;
}
head.next=list1==null?list2:list1;
return fakeHead.next;
}
}
public class ListNode {
int val;
ListNode next;
ListNode() {}
ListNode(int val) { this.val = val; }
ListNode(int val, ListNode next) { this.val = val; this.next = next; }
}
递归解法:
public class Solution {
public ListNode mergeTwoLists(ListNode list1, ListNode list2) {
if (list1==null){
return list2;
}
else if (list2==null){
return list1;
}
else if (list1.val<= list2.val){
list1.next=mergeTwoLists(list1.next,list2);
return list1;
}
else{
list2.next=mergeTwoLists(list1,list2.next);
return list2;
}
}
}
public class ListNode {
int val;
ListNode next;
ListNode() {}
ListNode(int val) { this.val = val; }
ListNode(int val, ListNode next) { this.val = val; this.next = next; }
}