/**
* 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 dummy(-1);
ListNode *p=&dummy;
while(l1!=NULL&&l2!=NULL)
{
if(l1->val<=l2->val)
{
p->next=l1;
l1=l1->next;
p=p->next;
p->next=NULL;
}else
{
p->next=l2;
l2=l2->next;
p=p->next;
p->next=NULL;
}
}
if(l1!=NULL)
{
p->next=l1;
}
if(l2!=NULL)
{
p->next=l2;
}
return dummy.next;
}
ListNode *mergeKLists(vector<ListNode *> &lists) {
int k=lists.size();
if(k==0)
return NULL;
ListNode *p=lists[0];
for(int i=1;i<k;i++)
{
p=mergeTwoLists(p,lists[i]);
}
return p;
}
};
* 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 dummy(-1);
ListNode *p=&dummy;
while(l1!=NULL&&l2!=NULL)
{
if(l1->val<=l2->val)
{
p->next=l1;
l1=l1->next;
p=p->next;
p->next=NULL;
}else
{
p->next=l2;
l2=l2->next;
p=p->next;
p->next=NULL;
}
}
if(l1!=NULL)
{
p->next=l1;
}
if(l2!=NULL)
{
p->next=l2;
}
return dummy.next;
}
ListNode *mergeKLists(vector<ListNode *> &lists) {
int k=lists.size();
if(k==0)
return NULL;
ListNode *p=lists[0];
for(int i=1;i<k;i++)
{
p=mergeTwoLists(p,lists[i]);
}
return p;
}
};