LeetCode 21. Merge Two Sorted Lists

最新推荐文章于 2022-05-22 13:07:29 发布

David_DLUT

最新推荐文章于 2022-05-22 13:07:29 发布

阅读量188

点赞数

分类专栏： LeetCode 文章标签： leetcode

本文链接：https://blog.csdn.net/David_DLUT/article/details/53941540

版权

LeetCode 专栏收录该内容

42 篇文章 0 订阅

订阅专栏

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.

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