AcWing 36. 合并两个排序的链表(尾插法)
原题链接
简单
作者:
Value
,
2020-09-04 13:04:08
,
所有人可见
,
阅读 707
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode* merge(ListNode* l1, ListNode* l2) {
ListNode *dummy = new ListNode(-1);
ListNode *r = dummy, *p;
while(l1 && l2){
if(l1->val < l2->val){
p = l1;
l1 = l1->next;
r->next = p;
r = p;
}else{
p = l2;
l2 = l2->next;
r->next = p;
r = p;
}
}
if(l1) r->next = l1;
if(l2) r->next = l2;
return dummy->next;
}
};