/**
* 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* l1, ListNode* l2) {
ListNode *p1 = l1;
ListNode *p2 = l2;
ListNode *new_head = new ListNode(0);
ListNode *current = new_head;
while(p1 && p2)
{
if(p1->val < p2->val)
{
current->next = p1;
p1 = p1->next;
current = current->next;
}else
{
current->next = p2;
p2 = p2->next;
current = current->next;
}
}
if(p1 == nullptr)
{
current->next = p2;
}else
{
current->next = p1;
}
new_head = new_head->next;
return new_head;
}
};
力扣刷题 12.合并两个有序链表——简单题
最新推荐文章于 2022-05-25 08:57:27 发布