题目描述
将两个有序链表合并为一个新的有序链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。
示例:
输入:1->2->4, 1->3->4
输出:1->1->2->3->4->4
思路:
1.递归;
2.迭代;
注意:当List1或者List2为空时,直接返回另一个。
代码:
class ListNode {
int val;
ListNode next;
ListNode(int x) {
val = x;
}
}
// 1.递归
// 2.迭代
public class MergeTwoLists21 {
public ListNode mergeTwoLists1(ListNode l1, ListNode l2) {
if (l1 == null) {
return l2;
}
if (l2 == null) {
return l1;
}
ListNode head;
if (l1.val < l2.val) {
head = l1;
head.next = mergeTwoLists1(l1.next, l2);
} else {
head = l2;
head.next = mergeTwoLists1(l1, l2.next);
}
return head;
}
public ListNode mergeTwoLists2(ListNode l1, ListNode l2) {
ListNode prehead = new ListNode(-1);
ListNode prev = prehead;
while (l1 != null && l2 != null) {
if (l1.val <= l2.val) {
prev.next = l1;
l1 = l1.next;
} else {
prev.next = l2;
l2 = l2.next;
}
prev = prev.next;
}
prev.next = l1 == null ? l2 : l1;
return prehead.next;
}
}