将两个有序链表合并为一个新的有序链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。
示例:
输入:1->2->4, 1->3->4 输出:1->1->2->3->4->4
public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
ListNode dummy = null;
ListNode currt = dummy;
while (l1 != null && l2 != null) {
if (l1.val < l2.val) {
currt.next = l1;
l1 = l1.next;
} else {
currt.next = l2;
l2 = l2.next;
}
currt = currt.next;
}
//当一个链表为空,合并剩余的元素
if (l1 != null) {
currt.next = l1;
}
if (l2 != null) {
currt.next = l1;
}
return dummy.next;
}
递归解法:
public static ListNode mergeTwoLists(ListNode l1, ListNode l2) {
if (l1 == null) {
return l2;
}
if (l2 == null) {
return l1;
}
if (l1.val < l2.val) {
l1.next = mergeTwoLists(l1.next, l2);
return l1;
} else {
l2.next = mergeTwoLists(l1, l2.next);
return l2;
}
}