链接:https://leetcode.cn/problems/merge-two-sorted-lists/submissions/
归并排序,要点是新建两个指针head和tail用于构造合并链表
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode() : val(0), next(nullptr) {}
* ListNode(int x) : val(x), next(nullptr) {}
* ListNode(int x, ListNode *next) : val(x), next(next) {}
* };
*/
class Solution {
public:
ListNode* mergeTwoLists(ListNode* list1, ListNode* list2) {
ListNode* head=new ListNode(-1);
ListNode* tail=head;
while(list1!=NULL && list2!=NULL){
if(list1->val<=list2->val){
tail->next=list1;
list1=list1->next;
}else{
tail->next=list2;
list2=list2->next;
}
tail=tail->next;
}
if(list1==NULL && list2!=NULL) tail->next=list2;
if(list1!=NULL && list2==NULL) tail->next=list1;
return head->next;
}
};