LeetCode 0021 - Merge Two Sorted Lists

Reck Zhang

发布于 2021-08-11 10:20:02

1860

发布于 2021-08-11 10:20:02

文章被收录于专栏：Reck Zhang

Merge Two Sorted Lists

Desicription

Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.

Solution

/**
 * 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 && !l2)
            return NULL;
        ListNode* head = new ListNode(0);
        ListNode* travel = head;
        while(l1 || l2){
            travel->next = new ListNode(0);
            if(!l1 || (l1 && l2 && l2->val <= l1->val)){
                travel->val = l2->val;
                l2 = l2->next;
                if(!l1 && !l2)
                    travel->next = NULL;
                travel = travel->next;
            }
            else if(!l2 || (l1 && l2 && l2->val > l1->val)){
                travel->val = l1->val;
                l1 = l1->next; 
                if(!l1 && !l2)
                    travel->next = NULL;
                travel = travel->next;
            } 
        }
        return head;
    }
};

本文参与腾讯云自媒体同步曝光计划，分享自作者个人站点/博客。

原始发表：2017-11-09，如有侵权请联系 cloudcommunity@tencent.com 删除

list