将两个 升序 链表合并为一个新的 升序 链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。
示例:
输入:1->2->4, 1->3->4
输出:1->1->2->3->4->4
原始代码:
//原始代码
/**
Definition for singly-linked list.
struct ListNode {
int val;
struct ListNode *next;
};
**/
struct ListNode* mergeTwoLists(struct ListNode* l1, struct ListNode* l2){
struct ListNode* L,* p,* q;
if (!l1) return l2;
if (!l2) return l1;
if (l1->val < l2->val) {
L = l1;
l1 = l1->next;
}else {
L = l2;
l2 = l2->next;
}
p = L;
while (l1 && l2) {
if (l1->val < l2->val) {
q = l1;
p->next = q;
p = p->next;
l1 = l1->next;
}else {
q = l2;
p->next = q;
p = p->next;
l2 = l2->next;
}
}
if (l1) { p->next = l1; }
if (l2) { p->next = l2; }
return L;
}
巧妙思路:递归
struct ListNode* mergeTwoLists(struct ListNode* l1, struct ListNode* l2) {
if(l1==NULL) return l2;
if(l2==NULL) return l1;
if(l1->val < l2->val){
l1->next = mergeTwoLists(l1->next,l2);
return l1;
}else{
l2->next = mergeTwoLists(l1,l2->next);
return l2;
}
}