Leetcode 21

最新推荐文章于 2024-05-01 19:51:18 发布

weixin_30662109

最新推荐文章于 2024-05-01 19:51:18 发布

阅读量45

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/cunyusup/p/9633887.html

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
//还可以简单的一遍AC

class Solution {
public:
    ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {
        ListNode *head = new ListNode(0);
        ListNode *move = head;
        while(l1 || l2){
            int data = 0;
            if(l1 == NULL){data = l2->val;l2 = l2->next;}
            else if(l2 == NULL){data = l1->val;l1 = l1->next;}
            else{
                if(l1->val < l2->val){data = l1->val;l1 = l1->next;}
                else{data = l2->val;l2 = l2->next;}
            }
            
            ListNode *add = new ListNode(data);
            move->next = add;
            move = move->next;
        }
        return head->next;
    }
};

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;
        }
    }
};

class Solution {
public:
    ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {
        if (!l1 || (l2 && l1->val > l2->val)) swap(l1, l2);
        if (l1) l1->next = mergeTwoLists(l1->next, l2);
        return l1;
    }
};

转载于:https://www.cnblogs.com/cunyusup/p/9633887.html