将两个有序链表合并为一个新的有序链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。
示例:
输入:1->2->4, 1->3->4
输出:1->1->2->3->4->4来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/merge-two-sorted-lists
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
解法:
/**
* 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 *pa = l1, *pb = l2, *p = new ListNode(0), *head = p;
while(pa && pb)
{
if(pa->val <= pb->val)
{
p->next = pa;
p = p->next;
pa = pa->next;
}
else
{
p->next = pb;
p = p->next;
pb = pb->next;
}
}
if(pa) p->next = pa;
if(pb) p->next = pb;
return head->next;
}
};