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) {
if (!l1) return l2;
if (!l2) return l1;
ListNode *head, *p;
if (l1->val < l2->val)
head = p = l1, l1 = l1->next;
else
head = p = l2, l2 = l2->next;
while (l1 || l2) {
if (l2==NULL || (l1 && l1->val < l2->val))
p->next = l1, l1 = l1->next;
else
p->next = l2, l2 = l2->next;
p = p->next;
}
p->next = NULL;
return head;
}
};