/**
* 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* newHead = new ListNode(0);
ListNode *p = l1, *q = l2, *t = newHead;
while(p && q) {
if(p->val <= q->val) t->next = p, p = p->next;
else t->next = q, q = q->next;
t = t->next;
}
if(p) t->next = p;
else t->next = q;
return newHead->next;
}
};
【leetcode 链表】【剑指 Offer】 25. 合并两个排序的链表 C++
最新推荐文章于 2022-07-02 00:16:42 发布