将两个升序链表合并为一个新的 升序 链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。
示例 1:
输入:l1 = [1,2,4], l2 = [1,3,4]
输出:[1,1,2,3,4,4]
示例 2:
输入:l1 = [], l2 = []
输出:[]
示例 3:
输入:l1 = [], l2 = [0]
输出:[0]
提示:
两个链表的节点数目范围是 [0, 50]
-100 <= Node.val <= 100
l1 和 l2 均按 非递减顺序 排列
ps.力扣已经预设了ListNode类,值为val,后继为next,无须自己定义。
有两种方法可实现功能。不论是使用迭代法还是递归法,当用N表示两个链表list1和list2的节点个数之和时,时间复杂度为O(N),空间复杂度为O(N)
迭代法
c++实现
class Solution {
public:
ListNode* mergeTwoLists(ListNode* list1, ListNode* list2) {
ListNode *result=new ListNode();
ListNode *cur=result;
while(list1!=NULL&&list2!=NULL)
{
if(list1->val<=list2->val)
{
cur->next=list1;
list1=list1->next;
}
else
{
cur->next=list2;
list2=list2->next;
}
cur=cur->next;
}
if(list1==NULL)
{cur->next=list2;}
if(list2==NULL)
{cur->next=list1;}
return result->next;
}
};
java实现
class Solution {
public ListNode mergeTwoLists(ListNode list1, ListNode list2) {
ListNode res=new ListNode();
ListNode cur=res;
while(list1!=null&&list2!=null)
{
if(list1.val<=list2.val)
{
cur.next=list1;
list1=list1.next;
}
else
{
cur.next=list2;
list2=list2.next;
}
cur=cur.next;
}
if(list1==null)
{cur.next=list2;}
if(list2==null)
{cur.next=list1;}
return res.next;
}
}
python实现
class Solution:
def mergeTwoLists(self, list1: Optional[ListNode], list2: Optional[ListNode]) -> Optional[ListNode]:
res=ListNode()
cur=res
while(list1!=None and list2!=None):
if list1.val<=list2.val:
cur.next=list1
list1=list1.next
else:
cur.next=list2
list2=list2.next
cur=cur.next
cur.next=list1 or list2
return res.next
递归法
c++实现
class Solution {
public:
ListNode* mergeTwoLists(ListNode* list1, ListNode* list2) {
if(list1==NULL||list2==NULL)
{return list1==NULL?list2:list1;}
if(list1->val<=list2->val)
{
list1->next=mergeTwoLists(list1->next,list2);
return list1;
}
else
{
list2->next=mergeTwoLists(list1,list2->next);
return list2;
}
}
};
java实现
class Solution {
public ListNode mergeTwoLists(ListNode list1, ListNode list2) {
if(list1==null||list2==null)
{return list1==null?list2:list1;}
if(list1.val<=list2.val)
{
list1.next=mergeTwoLists(list1.next,list2);
return list1;
}
else
{
list2.next=mergeTwoLists(list1,list2.next);
return list2;
}
}
}
python实现
class Solution:
def mergeTwoLists(self, list1: Optional[ListNode], list2: Optional[ListNode]) -> Optional[ListNode]:
if list1==None or list2==None:
return list1 or list2
if list1.val<=list2.val:
list1.next=self.mergeTwoLists(list1.next,list2)
return list1
else:
list2.next=self.mergeTwoLists(list1,list2.next)
return list2