题目
输入两个递增排序的链表,合并这两个链表并使新链表中的节点仍然是递增排序的。
示例1:
输入:1->2->4, 1->3->4
输出:1->1->2->3->4->4
限制:
0 <= 链表长度 <= 1000
代码
Python
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
# 思路:
# 建立哨兵,利用双指针求解
# 复杂度:
# O(N)
class Solution:
def mergeTwoLists(self, l1: ListNode, l2: ListNode) -> ListNode:
cur=tmp=ListNode(0) # 双指针
# 循环合并
while l1 and l2:
if l1.val<l2.val:
cur.next,l1=l1,l1.next
else:
cur.next,l2=l2,l2.next
cur=cur.next
cur.next=l1 if l1 else l2 # 合并剩余的尾部链表
return tmp.next
C++
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {
ListNode *tmp=new ListNode(0);
ListNode *cur=tmp;
while (l1&&l2) {
if (l1->val<l2->val) {
cur->next=l1;
l1=l1->next;
}
else {
cur->next=l2;
l2=l2->next;
}
cur=cur->next;
}
if (l1) cur->next=l1;
else cur->next=l2;
return tmp->next;
}
};