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

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

合併連結串列

Runtime: 4 ms, faster than 100.00% of C++ online submissions for Merge Two Sorted Lists.

class Solution
{
public:
  ListNode *mergeTwoLists(ListNode *l1, ListNode *l2)
  { //1 2 4 . 1 3 4
    ListNode *res = new ListNode(0);
    ListNode *cur = res;
    while (l1 != NULL && l2 != NULL)
    {
       
if (l1->val <= l2->val)
      {
        cur->next = l1;
        l1 = l1->next;
        cur = cur->next;
      }
      else
      {
        cur->next = l2;
        l2 = l2->next;
        cur = cur->next;
      }
    }
    if (l1 != NULL)
      cur->next = l1;
    else
      cur 
->next = l2;
    return res->next;
  }
};

[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（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

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

算法 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

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

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_Linked_List --21. Merge Two Sorted Lists [easy]

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【歸併排序】

題目 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—21. Merge Two Sorted Lists

LeetCode—21. Merge Two Sorted Lists 題目兩個有序連結串列，合併成一個。題目裡有一句話我沒理解好，她說“The new list should be made by splicing together the nodes of the first

LeetCode--21. Merge Two Sorted Lists

題目連結：https://leetcode.com/problems/merge-two-sorted-lists/ 這個題目要求合併兩個有序連結串列為一個有序連結串列，比較簡單在，這裡不贅述。程式碼如下： class Solution { public ListNode me

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 first

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

雙指標連結串列解法： /** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x)

LeetCode 21 Merge Two Sorted Lists（合併兩個已排序的連結串列）（Linked List）

翻譯合併兩個排好序的連結串列，並返回這個新連結串列。新連結串列應該由這兩個連結串列的頭部拼接而成。原文 Merge two sorted linked lists and return it as a new list. The new

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

題目要求合併兩個已排序的連結串列並將其作為新列表返回。新連結串列應該通過拼接前兩個連結串列的節點來完成。例子 Input: 1->2->4, 1->3->4 Output: 1->1->2->3->4->4

[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 first two lists. Example: In

leetcode 21. Merge Two Sorted Lists（23. Merge k Sorted Lists）

21. 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. Ex

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

相關推薦