{"id":4083,"date":"2018-09-27T19:48:53","date_gmt":"2018-09-28T02:48:53","guid":{"rendered":"https:\/\/zxi.mytechroad.com\/blog\/?p=4083"},"modified":"2018-09-27T19:52:13","modified_gmt":"2018-09-28T02:52:13","slug":"leetcode-88-merge-sorted-array","status":"publish","type":"post","link":"https:\/\/zxi.mytechroad.com\/blog\/algorithms\/array\/leetcode-88-merge-sorted-array\/","title":{"rendered":"\u82b1\u82b1\u9171 LeetCode 88. Merge Sorted Array"},"content":{"rendered":"<h1><strong>Problem<\/strong><\/h1>\n<p>Given two sorted integer arrays\u00a0<em>nums1<\/em>\u00a0and\u00a0<em>nums2<\/em>, merge\u00a0<em>nums2<\/em>\u00a0into\u00a0<em>nums1<\/em>\u00a0as one sorted array.<\/p>\n<p><strong>Note:<\/strong><\/p>\n<ul>\n<li>The number of elements initialized in\u00a0<em>nums1<\/em>\u00a0and\u00a0<em>nums2<\/em>\u00a0are\u00a0<em>m<\/em>\u00a0and\u00a0<em>n<\/em>\u00a0respectively.<\/li>\n<li>You may assume that\u00a0<em>nums1<\/em>\u00a0has enough space (size that is greater or equal to\u00a0<em>m<\/em>\u00a0+\u00a0<em>n<\/em>) to hold additional elements from\u00a0<em>nums2<\/em>.<\/li>\n<\/ul>\n<p><strong>Example:<\/strong><\/p>\n<pre class=\"crayon:false\"><strong>Input:<\/strong>\r\nnums1 = [1,2,3,0,0,0], m = 3\r\nnums2 = [2,5,6],       n = 3\r\n\r\n<strong>Output:<\/strong>\u00a0[1,2,2,3,5,6]\r\n<\/pre>\n<h1><strong>Solution:<\/strong><\/h1>\n<p>Fill nums1 from back to front<\/p>\n<p>Time complexity: O(m + n)<\/p>\n<p>Space complexity: O(1) in-place<\/p>\n<div class=\"responsive-tabs\">\n<h2 class=\"tabtitle\">C++<\/h2>\n<div class=\"tabcontent\">\n\n<pre class=\"lang:c++ decode:true \">\/\/ Author: Huahua\r\nclass Solution {\r\npublic:\r\n  void merge(vector&lt;int&gt;&amp; nums1, int m, vector&lt;int&gt;&amp; nums2, int n) {\r\n    int i = m - 1;\r\n    int j = n - 1;\r\n    int tail = m + n - 1;\r\n    while (j &gt;= 0)\r\n      nums1[tail--] = (i &gt;= 0 &amp;&amp; nums1[i] &gt; nums2[j]) ? nums1[i--] : nums2[j--];    \r\n  }\r\n};<\/pre>\n<\/div><\/div>\n","protected":false},"excerpt":{"rendered":"<p>Problem Given two sorted integer arrays\u00a0nums1\u00a0and\u00a0nums2, merge\u00a0nums2\u00a0into\u00a0nums1\u00a0as one sorted array. Note: The number of elements initialized in\u00a0nums1\u00a0and\u00a0nums2\u00a0are\u00a0m\u00a0and\u00a0n\u00a0respectively. You may assume that\u00a0nums1\u00a0has enough space (size that&#8230;<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[184],"tags":[222,129,23],"class_list":["post-4083","post","type-post","status-publish","format-standard","hentry","category-array","tag-easy","tag-merge","tag-sort","entry","simple"],"_links":{"self":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/4083","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=4083"}],"version-history":[{"count":3,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/4083\/revisions"}],"predecessor-version":[{"id":4086,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/4083\/revisions\/4086"}],"wp:attachment":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/media?parent=4083"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/categories?post=4083"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/tags?post=4083"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}