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 head(0);
ListNode* end = &head;
while(l1 && l2){
if(l1->val < l2->val){
end->next = l1;
l1 = l1->next;
}else{
end->next = l2;
l2 = l2->next;
}
end = end->next;
}
end->next = l1 ? l1 : l2;
return head.next;
}
};