{"id":7722,"date":"2020-11-28T11:07:25","date_gmt":"2020-11-28T19:07:25","guid":{"rendered":"https:\/\/zxi.mytechroad.com\/blog\/?p=7722"},"modified":"2020-11-28T11:08:10","modified_gmt":"2020-11-28T19:08:10","slug":"leetcode-1669-merge-in-between-linked-lists","status":"publish","type":"post","link":"https:\/\/zxi.mytechroad.com\/blog\/list\/leetcode-1669-merge-in-between-linked-lists\/","title":{"rendered":"\u82b1\u82b1\u9171 LeetCode 1669. Merge In Between Linked Lists"},"content":{"rendered":"\n

You are given two linked lists: list1<\/code> and list2<\/code> of sizes n<\/code> and m<\/code> respectively.<\/p>\n\n\n\n

Remove list1<\/code>‘s nodes from the ath<\/sup><\/code> node to the bth<\/sup><\/code> node, and put list2<\/code> in their place.<\/p>\n\n\n\n

The blue edges and nodes in the following figure incidate the result:<\/p>\n\n\n\n

\"\"\/<\/figure>\n\n\n\n

Build the result list and return its head.<\/em><\/p>\n\n\n\n

Example 1:<\/strong><\/p>\n\n\n\n

\"\"\/<\/figure>\n\n\n\n
Input:<\/strong> list1 = [0,1,2,3,4,5], a = 3, b = 4, list2 = [1000000,1000001,1000002]\nOutput:<\/strong> [0,1,2,1000000,1000001,1000002,5]\nExplanation:<\/strong> We remove the nodes 3 and 4 and put the entire list2 in their place. The blue edges and nodes in the above figure indicate the result.\n<\/pre>\n\n\n\n
Example 2:<\/strong><\/p>\n\n\n\n
\"\"\/<\/figure>\n\n\n\n
Input:<\/strong> list1 = [0,1,2,3,4,5,6], a = 2, b = 5, list2 = [1000000,1000001,1000002,1000003,1000004]\nOutput:<\/strong> [0,1,1000000,1000001,1000002,1000003,1000004,6]\nExplanation:<\/strong> The blue edges and nodes in the above figure indicate the result.\n<\/pre>\n\n\n\n
Constraints:<\/strong><\/p>\n\n\n\n
  • 3 <= list1.length <= 104<\/sup><\/code><\/li>
  • 1 <= a <= b < list1.length - 1<\/code><\/li>
  • 1 <= list2.length <= 104<\/sup><\/code><\/li><\/ul>\n\n\n\n
    Solution: List Operations<\/strong><\/h2>\n\n\n\n
    Find the following nodes:
    1. previous node to the a-th node: prev_a
    2. the b-th node: node_b
    3. tail node of list2: tail2

    prev_a->next = list2
    tail2->next = node_b

    return list1<\/p>\n\n\n\n
    Time complexity: O(m+n)
    Space complexity: O(1)<\/p>\n\n\n\n
    \n
    C++<\/h2>\n
    \n\n
    \n\/\/ Author: Huahua\nclass Solution {\npublic:\n  ListNode* mergeInBetween(ListNode* list1, int a, int b, ListNode* list2) {\n    ListNode dummy(0, list1);\n    ListNode* prev_a = &dummy;\n    for (int i = 0; i < a; ++i) prev_a = prev_a->next;\n    ListNode* node_b = prev_a->next;\n    for (int i = a; i <= b; ++i) node_b = node_b->next;\n    ListNode* tail2 = list2;\n    while (tail2->next) tail2 = tail2->next;\n    \n    prev_a->next = list2;    \n    tail2->next = node_b;\n    return list1;\n  }\n};\n<\/pre>\n<\/div><\/div>\n","protected":false},"excerpt":{"rendered":"
    You are given two linked lists: list1 and list2 of sizes n and m respectively. Remove list1‘s nodes from the ath node to the bth node, and put list2 in their place. The blue edges and nodes in the following…<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[50],"tags":[295,83,177,248,670],"class_list":["post-7722","post","type-post","status-publish","format-standard","hentry","category-list","tag-dummy-head","tag-list","tag-medium","tag-prev","tag-tail","entry","simple"],"_links":{"self":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/7722","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/comments?post=7722"}],"version-history":[{"count":2,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/7722\/revisions"}],"predecessor-version":[{"id":7724,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/7722\/revisions\/7724"}],"wp:attachment":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/media?parent=7722"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/categories?post=7722"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/tags?post=7722"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}