leetcode 85：merge-two-sorted-lists

阿新 • • 發佈：2020-08-11

題目描述

將兩個有序的連結串列合併為一個新連結串列，要求新的連結串列是通過拼接兩個連結串列的節點來生成的。 題目分析： 本問題是一個常規問題，先先建立一個表頭節點，然後比較給定的兩個連結串列的節點的值，依次連到表頭後面（如果一個表已經遍歷到尾節點了，另一個表直接連線到新連結串列的後面即可）。然後返回新表頭的下一個節點即可。程式碼如下：

 1 ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {
 2         ListNode* Nodel1 = l1;
 3     　　ListNode* Nodel2 = l2;
 4 
     　　ListNode* newHead = new ListNode(0);
 5     　　ListNode* cur = newHead;
 6     　　while (Nodel1 != nullptr&&Nodel2 != nullptr) {
 7         　　if (Nodel1->val > Nodel2->val)
 8        　　 {
 9             　　cur->next = Nodel2;
10             　　Nodel2 = Nodel2->next;
11         　　}
 
12         　　else
13         　　{
14             　　cur->next = Nodel1;
15             　　Nodel1 = Nodel1->next;
16         　　}
17         　　cur = cur->next;
18     　　}
19     　　if (Nodel1 != nullptr)
20        　　 cur->next = Nodel1;
21     　　if (Nodel2 != nullptr)
22         　　cur->next = Nodel2;
 
23     　　return newHead->next;
24     }

leetcode 85：merge-two-sorted-lists

題目描述將兩個有序的連結串列合併為一個新連結串列，要求新的連結串列是通過拼接兩個連結串列的節點來生成的。

Leetcode No.21 Merge Two Sorted Lists合併兩個有序連結串列(c++實現）

1. 題目 1.1 英文題目 Merge two sorted linked lists and return it as a sorted list. The list should be made by splicing together the nodes of the first two lists.

Leetcode 21. Merge Two Sorted Lists

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

LeetCode 0021 Merge Two Sorted Lists

原題傳送門 1. 題目描述 2. Solution 1 1、思路分析類似合併兩個有序陣列，設定兩個指標分別指向兩個連結串列的head，比較大小，把較小的結點從原始連結串列摘下掛到結果連結串列中。

leetcode-0021 merge-two-sorted-lists

You are given the heads of two sorted linked lists list1 and list2. Merge the two lists in a one sorted list. The list should be made by splicing together the nodes of the first two lists.

21. 合併兩個有序連結串列 Merge Two Sorted Lists

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

21. Merge Two Sorted Lists

LeetCode、連結串列 SLinkedList<int> slist = new SLinkedList<int>(); slist.Append(1); slist.Append(2);

Leetcode 23 Merge k Sorted Lists

題目介紹合併k個已經排序的連結串列。 Example: Input: [ 1->4->5, 1->3->4, 2->6

Merge k Sorted Lists

Given an array of linked-lists lists, each linked list is sorted in ascending order. Merge all the linked-lists into one sort linked-list and return it.

【堆】23. Merge k Sorted Lists

問題：給定k個有序連結串列，將這些連結串列的所有節點排序，組合成一個新的有序連結串列。

Leetcode 160. Intersection of Two Linked Lists

Description: Write a program to find the node at which the intersection of two singly linked lists begins.

23. 合併K個升序連結串列 Merge k Sorted Lists

You are given an array ofklinked-listslists, each linked-list is sorted in ascending order. Merge all the linked-lists into one sorted linked-list and return it.