将两个有序链表合并为一个新的有序链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。
示例:
输入:1->2->4, 1->3->4 输出:1->1->2->3->4->4
/**
* 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* start = new ListNode(-1);
ListNode* temp = start;
while(l1 && l2){
if(l1->val <= l2->val){
temp->next = l1;
l1 = l1->next;
}else{
temp->next = l2;
l2 = l2->next;
}
temp = temp->next;
}
if(l1){
temp->next = l1;
}
if(l2){
temp->next = l2;
}
return start->next;
}
};
/**
* 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 == 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(l2->next, l1);
return l2;//将短链表l1按顺序插进l2中。
}
}
};
采用的递归,