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.
// Source : https://oj.leetcode.com/problems/merge-two-sorted-lists/
// Author : Chao Zeng
// Date : 2014-12-21
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 *phead = new ListNode(0);
ListNode *p = phead;
while (l1 && l2){
if (l1->val < l2->val){;
p->next = l1;
l1 = l1->next;
}
else {
p->next = l2;
l2 = l2->next;
}
p = p->next;
}
if (!l1)
p->next = l2;
if (!l2)
p->next = l1;
return phead->next;
}
};
//简洁的递归算法
class Solution {
public:
ListNode *mergeTwoLists(ListNode *l1, ListNode *l2) {
if (!l1) return l2;
if (!l2) return l1;
ListNode *head = NULL;
if (l1->val < l2->val){
head = l1;
head->next = mergeTwoLists(l1->next,l2);
}
else{
head = l2;
head->next = mergeTwoLists(l1,l2->next);
}
return head;
}
};