题目描述:
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) {
if (!l1)
return l2;
if (!l2)
return l1;
ListNode *ret = new ListNode(0);
ListNode *node = ret;
while (l1&&l2){
if (l1->val < l2->val){
node->next = l1;
l1 = l1->next;
}
else{
node->next = l2;
l2 = l2->next;
}
node = node->next;
if (!l1)
node->next = l2;
if (!l2)
node->next = l1;
}
return ret->next;
}
};