题目描述
将两个有序链表合并为一个新的有序链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。
示例:
输入:1->2->4, 1->3->4
输出:1->1->2->3->4->4
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/merge-two-sorted-lists
思路
合并两个已有序的链表,注意题目给的链表没有头结点,所以为了操作方便可以自己设一个头结点,最后返回头结点的下一个节点即可。两个链表的工作指针就用传进来的l1 和l2 即可。
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) {
if(l1 == nullptr) return l2;
if(l2 == nullptr) return l1;
ListNode *pMergeHead = nullptr;
if(l1->val < l2->val){
pMergeHead = l1;
pMergeHead->next = mergeTwoLists(l1->next, l2);
}else{
pMergeHead = l2;
pMergeHead->next = mergeTwoLists(l1, l2->next);
}
return pMergeHead;
}
};
/**
* 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) {
if(l1 == nullptr) return l2;
if(l2 == nullptr) return l1;
ListNode dummy(-1); // 定义一个假的节点
ListNode *p = &dummy;
for(; l1 !=nullptr && l2 != nullptr; p = p->next){
if(l1->val > l2->val){
p->next = l2;
l2 = l2->next;
}else{
p->next = l1;
l1 = l1->next ;
}
}
p->next = l1 != nullptr ? l1 : l2;
return dummy.next;
}
};
/**
* 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 *res = new ListNode(0); // 自己设一个头结点
ListNode *pre = res; // pre代表已排好序的链表的最后一个节点
while(l1 && l2){
if(l1 -> val <= l2 -> val){
pre -> next = l1;
l1 = l1 -> next;
}
else{
pre -> next = l2;
l2 = l2 -> next;
}
pre = pre -> next; // pre后移
}
// 跳出循环时,l1和l2其中一个是NULL
if(l1) pre -> next = l1;
else pre -> next = l2;
// 释放头结点
ListNode *head = res;
res = head -> next;
head -> next = NULL;
delete head;
return res;
}
};