算法-合并两个有序链表
将两个有序链表合并为一个新的有序链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。
示例:
输入:1->2->4, 1->3->4
输出:1->1->2->3->4->4
来源:力扣(LeetCode)
思路一:
普通解法:先找到头后进入循环往下续。
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
ListNode result = new ListNode(0);
ListNode previous;
if(l1 == null){return l2;}
if(l2 == null){return l1;}
if(l1.val <= l2.val){
previous = l1;
l1 = l1.next;
}
else{
previous = l2;
l2 = l2.next;
}
result.next = previous;
while(l1 != null && l2 != null){
if(l1.val <= l2.val){
previous.next = l1;
l1 = l1.next;
}
else{
previous.next = l2;
l2 = l2.next;
}
previous = previous.next;
}
if(l1 != null){previous.next = l1;}
if(l2 != null){previous.next = l2;}
return result.next;
}
}
思路二:
普通解法的优化,思路来自 作者:reedfan 链接点击。
class Solution {
public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
if (l1 == null) {return l2;}
if (l2 == null) {return l1;}
ListNode tmp = new ListNode(0);
ListNode res = tmp;
while (l1 != null && l2 != null) {
if (l1.val < l2.val) {
tmp.next = l1;
l1 = l1.next;
}
else {
tmp.next = l2;
l2 = l2.next;
}
tmp = tmp.next;
}
if (l1 != null) {tmp.next = l1;}
if (l2 != null) {tmp.next = l2;}
return res.next;
}
}
思路三:
递归解法,思路来自 作者:reedfan 链接点击
public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
//递归的第一步:终止条件,l1 == null,则返回l2. l2 == null,则返回l1
if (l1 == null) {
return l2;
}
if (l2 == null) {
return l1;
}
if (l1.val < l2.val) {
//如果 l1 的 val 值更小,则将 l1.next 与排序好的链表头相接
l1.next = mergeTwoLists(l1.next, l2);
return l1;
} else {
//如果 l2 的 val 值更小,则将 l2.next 与排序好的链表头相接
l2.next = mergeTwoLists(l1, l2.next);
return l2;
}
}