erge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.
合并两个有序链表,合并后的链表仍然有序。
AC code:
/**
* 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 *dummyHead=new ListNode(0);
ListNode *p=dummyHead;
while(l1!=NULL&&l2!=NULL)
{
if(l1->val<l2->val)
{
p->next=l1;
l1=l1->next;
p=p->next;
}
else
{
p->next=l2;
l2=l2->next;
p=p->next;
}
}
if(l1!=NULL)
p->next=l1;
else
p->next=l2;
p=dummyHead->next;
delete dummyHead;
return p;
}
};