Merge 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.
解题思路:
合并两个有序链表。
/**
* 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 && l2) {
if (l1->val < l2->val) p->next = l1, l1 = l1->next;
else p->next = l2, l2 = l2->next;
p = p->next;
}
ListNode *pnode = (l1 == NULL) ? l2 : l1;
while (pnode) p->next = pnode, pnode = pnode->next, p = p->next;
return dummy.next;
}
};