LeetCode 21. 合并两个有序链表
原题链接
简单
作者:
ShineShaye
,
2022-07-04 22:24:37
,
所有人可见
,
阅读 105
/**
* 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) {
auto dummy = new ListNode(-1), tail = dummy;
while(list1 && list2)
{
if(list1->val <= list2->val)
{
tail = tail->next = list1;
list1 = list1->next;
}
else{
tail = tail->next = list2;
list2 = list2->next;
}
}
while(list1){
tail = tail->next = list1;
list1 = list1->next;
}
while(list2){
tail = tail->next = list2;
list2 = list2->next;
}
return dummy->next;
}
};