Leetcode 21. Merge Two Sorted Lists

最新推荐文章于 2024-04-03 21:24:25 发布

weixin_34413357

最新推荐文章于 2024-04-03 21:24:25 发布

阅读量46

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/ximelon/p/10822882.html

博客给出了LeetCode上合并两个有序链表题目的链接，同时还给出了相关题解的转载链接。

https://leetcode.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* mergeTwoLists(ListNode* l1, ListNode* l2) {
        if(l1==NULL) return l2;
        if(l2==NULL) return l1;
        if(l1->val>l2->val) return mergeTwoLists(l2,l1);
        ListNode *ans=l1,*p=l1;
        l1=l1->next;
        while(l1 && l2){
            if(l1->val < l2->val){
                ans->next=l1;
                ans=ans->next;
                l1=l1->next;
            }else{
                ans->next=l2;
                ans=ans->next;
                l2=l2->next;
            }
        }
        if(l1) ans->next=l1;
        else ans->next=l2;
        return p;
    }
};

转载于:https://www.cnblogs.com/ximelon/p/10822882.html