leetcode problem 21. Merge Two Sorted Lists

最新推荐文章于 2024-02-04 15:23:14 发布

bald

最新推荐文章于 2024-02-04 15:23:14 发布

阅读量153

点赞数

分类专栏： c++ leetcode

本文链接：https://blog.csdn.net/Aries_M/article/details/89186377

版权

c++ 同时被 2 个专栏收录

22 篇文章 0 订阅

订阅专栏

leetcode

16 篇文章 0 订阅

订阅专栏

Description

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.

Example:

Input: 1->2->4, 1->3->4
Output: 1->1->2->3->4->4

Solution

归并排序

code:

/**
 * 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 * head(0), *cur(0);
        if(l1==NULL) return l2;
        else if (l2==NULL) return l1;
        if(l1->val<l2->val){
            head=l1;
            l1=l1->next;
        }
        else
        {
            head=l2;
            l2=l2->next;
        }
        cur=head;
        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=l2;
        else cur->next=l1;
        return head;
    }
};

result:

Runtime: 8 ms, faster than 100.00% of C++ online submissions for Merge Two Sorted Lists.
Memory Usage: 8.9 MB, less than 100.00% of C++ online submissions for Merge Two Sorted Lists.

20190408 (补打卡

tbc