leecode算法《21. 合并两个有序链表》详解有注释,简单明了。
原题内容
将两个有序链表合并为一个新的有序链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。
示例:
输入:1->2->4, 1->3->4
输出:1->1->2->3->4->4
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/merge-two-sorted-lists
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
审题:解法一 迭代
这个题解法和合并数组的差不多
图解
代码1:
public static ListNode mergeTwoLists(ListNode l1, ListNode l2) {
// 创建一个头节点,用于循环
ListNode head = new ListNode(0);
// 创建返回的结果
ListNode result = head;
// 如果L1为空直接返回L2
if (l1 == null) {
return l2;
}
// 如果L12为空直接返回L1
if (l2 == null) {
return l1;
}
// 开始循环
while (l1 != null || l2 != null) {
// 如果L1和L2都不为空 并且L1《=L2
if (l1 != null && l2 != null && l1.val <= l2.val) {
head.next = l1;
l1 = l1.next;
head = head.next;
} else if (l2 != null) {
head.next = l2;
l2 = l2.next;
head = head.next;
} else {
head.next = l1;
l1 = l1.next;
head = head.next;
}
}
return result.next;
}
代码2:官方题解
public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
// maintain an unchanging reference to node ahead of the return node.
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;
}
// exactly one of l1 and l2 can be non-null at this point, so connect
// the non-null list to the end of the merged list.
prev.next = l1 == null ? l2 : l1;
return prehead.next;
}
审题:解法一 递归
代码
public static ListNode mergeTwoLists(ListNode l1, ListNode l2) {
if (l1 == null) {
return l2;
} else if (l2 == null) {
return l1;
} else if (l1.val < l2.val) {
l1.next = mergeTwoLists(l1.next, l2);
return l1;
} else {
l2.next = mergeTwoLists(l1, l2.next);
return l2;
}
}