将两个升序链表合并为一个新的升序链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。
/**
* 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) {
if(!l1)
return l2;
if(!l2)
return l1;
ListNode* pi = new ListNode(0);
ListNode* node = pi;
while(l1 && l2)
{
if(l1->val > l2->val) swap(l1,l2);
node->next = l1;
node = node->next;
l1 = l1->next;
}
node->next = l1 ? l1 : l2;
return pi->next;
}
};
-------------------------------------------------------------------------ViVi 2020-4-3--------