LeetCode---Merge Two Sorted Lists

阿新 • • 發佈：2018-11-19

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

：

採用兩個指標指向兩個連結串列，比較指標對應節點的大小，較小的節點即為下一個節點，同時指標指向下一個節點；

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){
         
if(l1 == nullptr)
            return l2;
        else if(l2 == nullptr)
            return l1;
        // 兩個連結串列都不為空
        ListNode *pMerge = nullptr;
        if(l1->val < l2->val){
            pMerge = l1;
            pMerge->next = mergeTwoLists(l1->next, l2);
        }
         
else{
            pMerge = l2;
            pMerge->next = mergeTwoLists(l1, l2->next);
        }
        return pMerge;
    }
};

Reports: Runtime: 8 ms, faster than 89.04% of C++ online submissions for Merge Two Sorted Lists.

LeetCode——Merge Two Sorted Lists

sort -h ould des family tco 返回 https style Merge two sorted linked lists and return it as a new list. The new list should be made by

leetcode - Merge Two Sorted Lists

cin height mod sorted col truct pos data- first Merge two sorted linked lists and return it as a new list. The new list should be mad

[LeetCode] Merge Two Sorted Lists

合並 linked new ace oge tco div nullptr etc Merge two sorted linked lists and return it as a new list. The new list should be made by splic

LeetCode---Merge Two Sorted Lists

Question: Merge Two Sorted Lists Description: Merge two sorted linked lists and return it as a new list. The new list should be made by splicing

LeetCode Merge Two Sorted Lists

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. Exampl

[LeetCode] Merge Two Sorted Lists 混合插入有序連結串列

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. 這道混合插入有序

Leetcode:Merge Two Sorted Lists

題目連結 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. 1為了操

LeetCode—Merge Two Sorted Lists融合兩個有序單鏈表

首先兩個單鏈表是有序的在融合兩個單鏈表的時候，如果想到的是在一個序列上進行增減，那麼會非常麻煩這裡一定要單獨開一個序列頭進行儲存，不一定需要開闢記憶體，主要是一個概念其實方法感覺和歸併演算法的merge都是一個概念 /** * Definition for sing

Leetcode 21. Merge Two Sorted Lists

oge span solution clas next ini 遞歸解法 else get Merge two sorted linked lists and return it as a new list. The new list should be made by s

leetcode 21 -- Merge Two Sorted Lists

tro leet lan 常見 ber 題目 tty Language node Merge Two Sorted Lists 題目： Merge two sorted linked lists and return it as a ne

Leetcode 21. Merge Two Sorted Lists（easy）

tco fin public def div wol lists lis else Merge two sorted linked lists and return it as a new list. The new list should be made by spli

LeetCode.21 - Merge Two Sorted Lists

算法 tput out oge 其中 png 就會 std info Merge two sorted linked lists and return it as a new list. The new list should be made by splicing tog

leetcode#21 Merge Two Sorted Lists

solution ould pub eth linked public and urn ini Merge two sorted linked lists and return it as a new list. The new list should be made by

LeetCode#21: Merge Two Sorted Lists

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

leetcode:(21) Merge Two Sorted Lists(java)

package LeetCode_LinkedList; /** * 題目： * Merge two sorted linked lists and return it as a new list. * The new list should be made by spl

[leetcode] 21. Merge Two Sorted Lists (Easy)

合併連結串列 Runtime: 4 ms, faster than 100.00% of C++ online submissions for Merge Two Sorted Lists. class Solution { public: ListNode *mergeTwoList

[Leetcode]21. Merge Two Sorted Lists

合併兩個排序好的列表，遞迴演算法pass /** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x)

【LeetCode】21. Merge Two Sorted Lists - Java實現

文章目錄 1. 題目描述： 2. 思路分析： 3. Java程式碼： 1. 題目描述： Merge two sorted linked lists and return it as a new list. The new list

C# 寫 LeetCode easy #21 Merge Two Sorted Lists

21、 Merge Two Sorted Lists 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 fi

LeetCode 21: Merge Two Sorted Lists（合併兩個有序連結串列）

原題 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 fir

LeetCode---Merge Two Sorted Lists

相關推薦