将两个有序链表合并为一个新的有序链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。
示例:
输入:1->2->4, 1->3->4
输出:1->1->2->3->4->4
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/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* fun(ListNode* l1, ListNode* l2){
ListNode* rt = l1;
ListNode* p = l1;
while(l1 && l2){
if(l1 -> val <= l2 -> val){
p = l1;
l1 = l1 -> next;
}
else{
ListNode* q = new ListNode(l2 -> val);
l2 = l2 -> next;
p -> next = q;
q -> next = l1;
p = p -> next;
}
}
if(l2) p -> next = l2;
return rt;
}
ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {
if(l1 == NULL && l2 != NULL) return l2;
if(l1 != NULL && l2 == NULL) return l1;
if(l1 == NULL && l2 == NULL) return NULL;
ListNode* rt = NULL;
if(l1 -> val <= l2 -> val) rt = fun(l1,l2);
else rt = fun(l2,l1);
return rt;
}
};
方法二,递归法:
/**
* 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;
if(l1 -> val <= l2 -> val){
l1 -> next = mergeTwoLists(l1 -> next, l2);
return l1;
}
else{
l2 -> next = mergeTwoLists(l1, l2 -> next);
return l2;
}
}
};