{"id":7342,"date":"2025-06-27T16:20:45","date_gmt":"2025-06-27T10:50:45","guid":{"rendered":"https:\/\/namastedev.com\/blog\/?p=7342"},"modified":"2025-06-28T20:53:29","modified_gmt":"2025-06-28T15:23:29","slug":"merge-sorted-arrays","status":"publish","type":"post","link":"https:\/\/namastedev.com\/blog\/merge-sorted-arrays\/","title":{"rendered":"Merge Sorted Arrays"},"content":{"rendered":"\n<link\n    href=\"https:\/\/cdn.jsdelivr.net\/npm\/prismjs@1.29.0\/themes\/prism-tomorrow.min.css\"\n    rel=\"stylesheet\"\n\/>\n<script src=\"https:\/\/cdn.jsdelivr.net\/npm\/prismjs@1.29.0\/prism.min.js\"><\/script>\n<script src=\"https:\/\/cdn.jsdelivr.net\/npm\/prismjs@1.29.0\/plugins\/autoloader\/prism-autoloader.min.js\"><\/script>\n\n<style> \n.wp_blog_theme {\n  --primary: #E58C32;\n  --secondary: #f8c291;\n  --light-bg: #fef9f4;\n  --text-dark: #2d2d2d;\n  --tab-radius: 12px;\n  --shadow: 0 4px 12px rgba(0, 0, 0, 0.08);\n  --code-bg: #001f3f;\n  --code-text: #d4f1ff;\n}\n\n.wp_blog_container {\n  font-family: 'Segoe UI', sans-serif;\n  background: var(--light-bg);\n  margin: 0;\n  padding: 0;\n  color: var(--text-dark);\n}\n\n\/* Heading *\/\n.wp_blog_main-heading {\n  text-align: center;\n  font-size: 2.4rem;\n  color: var(--primary);\n  margin-top: 2.5rem;\n  font-weight: bold;\n}\n\n\/* Explanation Card *\/\n.wp_blog_explanation,\n.wp_blog_code-tabs-container {\n  max-width: 940px;\n  margin: 2rem auto;\n  padding: 2rem;\n  background: white;\n  border-radius: var(--tab-radius);\n  box-shadow: var(--shadow);\n}\n\n\/* Text and Visuals *\/\n.wp_blog_explanation h2{\n  font-size: 1.4rem;\n  color: var(--primary);\n  margin-bottom: 0.5rem;\n}\n.wp_blog_explanation h5{\n  color: var(--primary);\n}\n\n.wp_blog_explanation p,\n.wp_blog_explanation li {\n  font-size: 1.05rem;\n  line-height: 1.7;\n  margin: 0.5rem 0;\n}\n.wp_blog_explanation code {\n  background: #f9cea6;\n  color: #2d2d2d;\n  padding: 3px 6px;\n  border-radius: 4px;\n  font-family: 'Courier New', monospace;\n}\n.wp_blog_explanation img {\n  max-width: 100%;\n  border-radius: var(--tab-radius);\n  margin-top: 1rem;\n  box-shadow: 0 2px 12px rgba(0,0,0,0.06);\n}\n\n\/* Tab Buttons *\/\n.wp_blog_code-tabs-header {\n  display: flex;\n  flex-wrap: wrap;\n  gap: 0.5rem;\n  margin-bottom: 1rem;\n}\n.wp_blog_code-tab-button {\n  padding: 0.6rem 1.2rem;\n  border: 1px solid var(--primary);\n  background: white;\n  color: var(--primary);\n  border-radius: 50px;\n  font-weight: 600;\n  cursor: pointer;\n  transition: all 0.3s ease;\n}\n.wp_blog_code-tab-button:hover {\n  background: var(--secondary);\n}\n.wp_blog_code-tab-button.active {\n  background: var(--primary);\n  color: white;\n}\n\n\/* Code Content *\/\n.wp_blog_code-tab-content {\n  display: none;\n  background: var(--code-bg);\n  border-radius: var(--tab-radius);\n}\n.wp_blog_code-tab-content.active {\n  display: block;\n}\n.wp_blog_code-tab-content pre {\n  margin: 0;\n  padding: 1.5rem;\n  font-size: 1rem;\n  overflow-x: auto;\n  background: var(--code-bg);\n  border-radius: var(--tab-radius);\n  color: var(--code-text);\n}\n<\/style>\n\n<div class=\"wp_blog_container wp_blog_theme\"> \n    <h1 class=\"wp_blog_main-heading\"><\/h1>\n    <div class=\"wp_blog_explanation\">\n        <h2>Problem Statement:<\/h2>\n\n        <p>\n           You are given two integer arrays <code>nums1<\/code> and <code>nums2<\/code>, sorted in non-decreasing order, and two integers <code>m<\/code> and <code>n<\/code>, representing the number of elements in nums1 and nums2 respectively.\n        <\/p>      \n\n        <p>\n            Merge<code>nums1<\/code> and <code>nums2<\/code> into a single array sorted in non-decreasing order.     \n        <\/p>\n        <p>\n            The final sorted array should not be returned by the function, but instead be stored inside the array <code>nums1<\/code>. To accommodate this, nums1 has a length of <code>m + n<\/code>, where the first <code>m<\/code> elements denote the elements that should be merged, and the last <code>n<\/code> elements are set to 0 and should be ignored. <code>nums2<\/code> has a length of <code>n<\/code>.\n        <\/p>\n\n                <h2>Examples:<\/h2>\n\n                <h5>Example 1:<\/h5>\n                <p><strong>Input:<\/strong>\n                    <p>\n                        nums1 = [1,2,3,0,0,0], m = 3\n                        nums2 = [2,5,6], n = 3\n                    <\/p>\n                <\/p>\n                <p><strong>Output:<\/strong> [1,2,2,3,5,6]<\/p>\n                <p>\n                  <code>Explanation:<\/code>\n                  The arrays we are merging are [1,2,3] and [2,5,6]. The result of the merge is [1,2,2,3,5,6] with the underlined elements coming from nums1.\n                <\/p>\n\n                <h5>Example 2:<\/h5>\n                <p><strong>Input:<\/strong><\/p>\n                    <p>\n                        nums1 = [1], m = 1, \n                        nums2 = [], n = 0<\/p>\n\n                    <\/p>\n                <p><strong>Output:<\/strong>[1]<\/p>\n                  <p>\n                  <code>Explanation:<\/code>\n                 The arrays we are merging are [1] and [].\n                 The result of the merge is [1].\n                <\/p>\n\n                <h5>Example 3:<\/h5>\n                <p><strong>Input:<\/strong>\n                <\/p>\n                <p>\n                    nums1 = [0], m = 0\n                    nums2 = [1], n = 1\n                <\/p>    \n                <p><strong>Output:<\/strong>[1]<\/p>\n                  <p>\n                  <code>Explanation:<\/code>\n                 The arrays we are merging are [] and [1].\n                    The result of the merge is [1].\n                    Note that because m = 0, there are no elements in nums1. \n                    The 0 is only there to ensure the merge result can fit in nums1.\n                <\/p>\n                    \n                    <h2>Time Complexity:<\/h2>\n                    <li>\n                      <p><strong>Time Complexity = O((m+n) log (m+n))<\/strong>\n                    Due to sorting.\n                      <\/li>\n                    <h2>Space Complexity:<\/h2>\n                    <li>\n                      <p><strong>Space Complexity = O(1)<\/strong>\n                      Extra (in-place).<\/p>\n                    <\/li>\n\n                <h2>Approach: Brute Force (Simple Concatenate + Sort)<\/h2>\n                <ul>\n                    <li>\n                    Overwrite the trailing zeros in <code>nums1<\/code> (from index m onwards) with all elements of <code>nums2<\/code>.    \n                    <\/li>\n                    <li>Sort the whole <code>nums1<\/code> array.<\/li>\n                <\/ul>\n\n\n                <h2>Dry Run<\/h2>\n                  <div style=\"background: #f9f9f9; border-left: 4px solid var(--primary); padding: 1rem; border-radius: var(--tab-radius); margin: 1rem 0;\">\n                  <p><strong>Input:<\/strong> <code>\n                    nums1 = [1, 2, 3, 0, 0, 0], m = 3\n                    nums2 = [2, 5, 6], n = 3\n                <\/code><\/p>\n                  <pre style=\"white-space: pre-wrap; background: #fff5ea; padding: 1rem; border-radius: 8px; overflow-x: auto;\">\n\n    1. Copy nums2 into nums1 \n       i = 3 to 5:\n            nums1[3] = nums2[0] = 2\n            nums1[4] = nums2[1] = 5\n            nums1[5] = nums2[2] = 6 \n            \n        => nums1 = [1, 2, 3, 2, 5, 6]\n\n    2. Sort the array\n        nums1.sort((a, b) => a - b)\n        => [1, 2, 2, 3, 5, 6]\n  <\/pre>\n                <!-- <p><strong>Output:<\/strong> <code>Result: [\"o\", \"l\", \"l\", \"e\", \"h\"]<\/code><\/p> -->\n                  <\/div>\n    <\/div>\n\n    <div class=\"wp_blog_code-tabs-container\">\n        <div class=\"wp_blog_code-tabs-header\">\n            <button class=\"wp_blog_code-tab-button active\" data-lang=\"js\">JavaScript<\/button>\n            <button class=\"wp_blog_code-tab-button\" data-lang=\"py\">Python<\/button>\n            <button class=\"wp_blog_code-tab-button\" data-lang=\"java\">Java<\/button>\n            <button class=\"wp_blog_code-tab-button\" data-lang=\"cpp\">C++<\/button>\n            <button class=\"wp_blog_code-tab-button\" data-lang=\"c\">C<\/button>\n            <button class=\"wp_blog_code-tab-button\" data-lang=\"cs\">C#<\/button>\n        <\/div>\n\n        <!-- JavaScript -->\n        <div class=\"wp_blog_code-tab-content active\" data-lang=\"js\">\n            <pre><code class=\"language-javascript\">\n var merge = function(nums1, m, nums2, n) {\n    for (let i = m; i < nums1.length; i++) {\n      nums1[i] = nums2[i - m];\n    }\n    nums1.sort((a, b) => a - b);\n  };     <\/code><\/pre>\n        <\/div>\n\n        <!-- Python -->\n        <div class=\"wp_blog_code-tab-content\" data-lang=\"py\">\n            <pre><code class=\"language-python\">\n class Solution(object):\n    def merge(self, nums1, m, nums2, n):\n      for i in range(n):\n        nums1[m + i] = nums2[i]\n      nums1.sort()\n            <\/code><\/pre>\n        <\/div>\n\n        <!-- Java -->\n        <div class=\"wp_blog_code-tab-content\" data-lang=\"java\">\n            <pre><code class=\"language-java\">\nimport java.util.Arrays;\n  \n  class Solution {\n    public void merge(int[] nums1, int m, int[] nums2, int n) {\n      for (int i = 0; i < n; i++) {\n        nums1[m + i] = nums2[i];\n      }\n      Arrays.sort(nums1);\n    }\n  }        <\/code><\/pre>\n        <\/div>\n\n        <!-- C++ -->\n        <div class=\"wp_blog_code-tab-content\" data-lang=\"cpp\">\n            <pre><code class=\"language-cpp\">\n  #include &lt;vector&gt;\n  #include &lt;algorithm&gt;\n  using namespace std;\n  \n  class Solution {\n  public:\n    void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {\n      for (int i = 0; i < n; ++i) {\n        nums1[m + i] = nums2[i];\n      }\n      sort(nums1.begin(), nums1.begin() + m + n);\n    }\n  };    <\/code><\/pre>\n        <\/div>\n\n        <!-- C -->\n        <div class=\"wp_blog_code-tab-content\" data-lang=\"c\">\n            <pre><code class=\"language-c\">\n#include &lt;stdlib.h&gt;        \n int compare(const void *a, const void *b) {\n    return (*(int*)a - *(int*)b);\n  }\n  \n  void merge(int* nums1, int nums1Size, int m, int* nums2, int nums2Size, int n) {\n    for (int i = 0; i < n; ++i) {\n      nums1[m + i] = nums2[i];\n    }\n    qsort(nums1, m + n, sizeof(int), compare);\n  }\n<\/code><\/pre>\n        <\/div>\n\n        <!-- C# -->\n        <div class=\"wp_blog_code-tab-content\" data-lang=\"cs\">\n            <pre><code class=\"language-csharp\">\nusing System;\n\npublic class Solution {\n    public void Merge(int[] nums1, int m, int[] nums2, int n) {\n      for (int i = 0; i < n; ++i) {\n        nums1[m + i] = nums2[i];\n      }\n      Array.Sort(nums1, 0, m + n);\n    }\n}        <\/code><\/pre>\n        <\/div>\n    <\/div>\n<\/div>\n<!-- approach 2 -->\n <div class=\"wp_blog_container wp_blog_theme\"> \n    <h1 class=\"wp_blog_main-heading\"><\/h1>\n    <div class=\"wp_blog_explanation\">\n        <h2>Approach 2: Two-Pointer Method<\/h2>\n     <ul>\n         <li>\n            Instead of sorting at the end, this algorithm merges the arrays in sorted order using two pointers:\n         <\/li>\n         <li>Copy the first m elements of nums1 into a temporary array (nums1Copy).\n         Use two pointers p1 (for nums1Copy) and p2 (for nums2) to compare elements.\n         At each index i of nums1, place the smaller of the elements from nums1Copy[p1] and nums2[p2]. <\/li>   \n         <li>\n             Repeat until nums1 is fully filled with the merged sorted elements..\n         <\/li>\n     <\/ul>    \n                    <h2>Time Complexity:<\/h2>\n                    <li>\n                      <p><strong>Time Complexity = O(m+n)<\/strong>\n                    <p>\n                      <code>Explanation:<\/code>\n                      \n                      <ul>\n                        <li>Copying the first m elements to nums1Copy takes O(m).<\/li>\n                        <li>Merging the two sorted arrays takes O(m + n) because each index in nums1 is visited exactly once.<\/li>\n                      <\/ul>\n                    <\/li>\n                  <\/p>\n                    <h2>Space Complexity:<\/h2>\n                    <li>\n                    <strong>Space Complexity = O(m)<\/strong>\n                      <p><code>Explanation:<\/code><\/p>\n                      <p>\n                        <ul>\n                         <li>\n                           You create a copy of the first m elements of nums1 in nums1Copy, which takes O(m) additional space.\n                         <\/li>\n                        <\/ul>\n                    <\/p>\n                    <\/li>\n\n\n                <h2>Dry Run<\/h2>\n                  <div style=\"background: #f9f9f9; border-left: 4px solid var(--primary); padding: 1rem; border-radius: var(--tab-radius); margin: 1rem 0;\">\n                  <p><strong>Input:<\/strong> <code>\n                    nums1 = [1, 2, 3, 0, 0, 0], m = 3\n                    nums2 = [2, 5, 6], n = 3\n                <\/code><\/p>\n                <p>\n                    <code>Execution<\/code>\n                    nums1Copy = [1,2,3], p1 = 0, p2 = 0\n                <\/p>\n                  <pre style=\"white-space: pre-wrap; background: #fff5ea; padding: 1rem; border-radius: 8px; overflow-x: auto;\">\n\n        nums1Copy[0]=1 < nums2[0]=2 \u2192 nums1[0] = 1, p1++\n        nums1Copy[1]=2 == nums2[0]=2 \u2192 nums1[1] = 2, p2++\n        nums1Copy[1]=2 < nums2[1]=5 \u2192 nums1[2] = 2, p1++\n        nums1Copy[2]=3 < nums2[1]=5 \u2192 nums1[3] = 3, p1++\n        p1==3 \u2192 only nums2 left\n        nums1[4] = 5, nums1[5] = 6\n  <\/pre>\n                <p><strong>Output:<\/strong> <code>nums1 = [1,2,2,3,5,6]<\/code><\/p>\n                  <\/div>\n                \n        <!-- <h2>Visualisation:<\/h2>\n        <img decoding=\"async\" src=\"https:\/\/namastedev.com\/blog\/wp-content\/uploads\/2025\/06\/Screenshot-2025-06-27-at-12.58.36\u202fPM.png\" alt=\"Stocks\" \/> -->\n    <\/div>\n\n    <div class=\"wp_blog_code-tabs-container\">\n        <div class=\"wp_blog_code-tabs-header\">\n            <button class=\"wp_blog_code-tab-button active\" data-lang=\"js\">JavaScript<\/button>\n            <button class=\"wp_blog_code-tab-button\" data-lang=\"py\">Python<\/button>\n            <button class=\"wp_blog_code-tab-button\" data-lang=\"java\">Java<\/button>\n            <button class=\"wp_blog_code-tab-button\" data-lang=\"cpp\">C++<\/button>\n            <button class=\"wp_blog_code-tab-button\" data-lang=\"c\">C<\/button>\n            <button class=\"wp_blog_code-tab-button\" data-lang=\"cs\">C#<\/button>\n        <\/div>\n\n        <!-- JavaScript -->\n        <div class=\"wp_blog_code-tab-content active\" data-lang=\"js\">\n            <pre><code class=\"language-javascript\">\nvar merge = function(nums1, m, nums2, n) {\n      let nums1Copy = nums1.slice(0, m)\n      let p1 = 0;\n      let p2 = 0;\n      for (let i = 0; i < m + n; i++) {\n          if (p2 >= n || (p1 < m &#038;&#038; nums1Copy[p1] < nums2[p2])) {\n              nums1[i] = nums1Copy[p1];\n              p1++;\n          } else {\n              nums1[i] = nums2[p2];\n              p2++;\n          }\n      }\n  };    <\/code><\/pre>\n        <\/div>\n\n        <!-- Python -->\n        <div class=\"wp_blog_code-tab-content\" data-lang=\"py\">\n            <pre><code class=\"language-python\">\n  class Solution:\n      def merge(self, nums1, m, nums2, n):\n          nums1_copy = nums1[:m]\n          p1 = p2 = 0\n  \n          for i in range(m + n):\n              if p2 >= n or (p1 < m and nums1_copy[p1] < nums2[p2]):\n                  nums1[i] = nums1_copy[p1]\n                  p1 += 1\n              else:\n                  nums1[i] = nums2[p2]\n                  p2 += 1\n            <\/code><\/pre>\n        <\/div>\n\n        <!-- Java -->\n        <div class=\"wp_blog_code-tab-content\" data-lang=\"java\">\n            <pre><code class=\"language-java\">\nclass Solution {\n      public void merge(int[] nums1, int m, int[] nums2, int n) {\n          int[] nums1Copy = new int[m];\n          System.arraycopy(nums1, 0, nums1Copy, 0, m);\n  \n          int p1 = 0, p2 = 0;\n          for (int i = 0; i < m + n; i++) {\n              if (p2 >= n || (p1 < m &#038;&#038; nums1Copy[p1] < nums2[p2])) {\n                  nums1[i] = nums1Copy[p1++];\n              } else {\n                  nums1[i] = nums2[p2++];\n              }\n          }\n      }\n  }      <\/code><\/pre>\n        <\/div>\n\n        <!-- C++ -->\n        <div class=\"wp_blog_code-tab-content\" data-lang=\"cpp\">\n            <pre><code class=\"language-cpp\">\nclass Solution {\n  public:\n      void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {\n          vector<int> nums1Copy(nums1.begin(), nums1.begin() + m);\n          int p1 = 0, p2 = 0;\n          for (int i = 0; i < m + n; ++i) {\n              if (p2 >= n || (p1 < m &#038;&#038; nums1Copy[p1] < nums2[p2])) {\n                  nums1[i] = nums1Copy[p1++];\n              } else {\n                  nums1[i] = nums2[p2++];\n              }\n          }\n      }\n  };    <\/code><\/pre>\n        <\/div>\n\n        <!-- C -->\n        <div class=\"wp_blog_code-tab-content\" data-lang=\"c\">\n            <pre><code class=\"language-c\">\n#include &lt;stdlib.h&gt; \n\n  void merge(int* nums1, int nums1Size, int m, int* nums2, int nums2Size, int n) {\n      int* nums1Copy = (int*)malloc(m * sizeof(int));\n      for (int i = 0; i < m; ++i) nums1Copy[i] = nums1[i];\n  \n      int p1 = 0, p2 = 0;\n      for (int i = 0; i < m + n; ++i) {\n          if (p2 >= n || (p1 < m &#038;&#038; nums1Copy[p1] < nums2[p2])) {\n              nums1[i] = nums1Copy[p1++];\n          } else {\n              nums1[i] = nums2[p2++];\n          }\n      }\n      free(nums1Copy);\n  }\n<\/code><\/pre>\n        <\/div>\n\n        <!-- C# -->\n        <div class=\"wp_blog_code-tab-content\" data-lang=\"cs\">\n            <pre><code class=\"language-csharp\">\nusing System;\n\npublic class Solution {\npublic void Merge(int[] nums1, int m, int[] nums2, int n) {\n    int[] nums1Copy = new int[m];\n    Array.Copy(nums1, nums1Copy, m);\n    int p1 = 0, p2 = 0;\n     for (int i = 0; i < m + n; i++) {\n        if (p2 >= n || (p1 < m &#038;&#038; nums1Copy[p1] < nums2[p2])) {\n         nums1[i] = nums1Copy[p1];\n         p1++;\n        } else {\n         nums1[i] = nums2[p2];\n         p2++;\n        }\n        }\n    }\n}       <\/code><\/pre>\n        <\/div>\n    <\/div>\n<\/div>\n\n<!-- approach 3 Optimal -->\n  <div class=\"wp_blog_container wp_blog_theme\"> \n    <h1 class=\"wp_blog_main-heading\"><\/h1>\n    <div class=\"wp_blog_explanation\">\n        <h2>Optimal Approach<\/h2>\n        <ul>\n            <li>We have two sorted arrays:<\/li>\n            <li>nums1 with length m + n where the first m elements are valid.<\/li>\n            <li>nums2 with n elements.<\/li>\n            <li>The goal: merge nums2 into nums1 in sorted order in-place.<\/li>\n            <li>Start filling nums1 from the end (index m + n - 1), comparing the last elements of both arrays (nums1[m-1] and nums2[n-1]).<\/li>\n            <li>Place the larger element at the current last position.<\/li>\n            <li>Move pointers accordingly:<\/li>\n            <li>Decrement the pointer in nums1 or nums2.<\/li>\n            <li>Decrement the position pointer for placement.<\/li>\n            <li>If nums2 is exhausted first, merging is done.<\/li>\n            <li>If nums1 is exhausted first, copy remaining elements of nums2.<\/li>\n        <\/ul>\n\n                    <h2>Time Complexity:<\/h2>\n                    <li>\n                      <p><strong>Time Complexity = O((m+n) log (m+n))<\/strong>\n                    Due to sorting.\n                      <\/li>\n                    <h2>Space Complexity:<\/h2>\n                    <li>\n                      <p><strong>Space Complexity = O(1) (constant space)<\/strong> <\/p>\n                      <p><code>Explanation<\/code><\/p>\n                      <p>\n                        <ul>\n                          <li>No extra significant space is used (in-place).<\/li>\n                          <li>Only a few variables (p1, p2, i) are used.<\/li>\n                        <\/ul>\n                      <\/p>\n                    <\/li>\n    <\/div>\n\n    <div class=\"wp_blog_code-tabs-container\">\n        <div class=\"wp_blog_code-tabs-header\">\n            <button class=\"wp_blog_code-tab-button active\" data-lang=\"js\">JavaScript<\/button>\n            <button class=\"wp_blog_code-tab-button\" data-lang=\"py\">Python<\/button>\n            <button class=\"wp_blog_code-tab-button\" data-lang=\"java\">Java<\/button>\n            <button class=\"wp_blog_code-tab-button\" data-lang=\"cpp\">C++<\/button>\n            <button class=\"wp_blog_code-tab-button\" data-lang=\"c\">C<\/button>\n            <button class=\"wp_blog_code-tab-button\" data-lang=\"cs\">C#<\/button>\n        <\/div>\n\n        <!-- JavaScript -->\n        <div class=\"wp_blog_code-tab-content active\" data-lang=\"js\">\n            <pre><code class=\"language-javascript\">\n  var merge = function(nums1, m, nums2, n) {\n    let p1 = m - 1;\n    let p2 = n - 1;\n  \n    for (let i = m + n - 1; i >= 0; i--) {\n      if (p2 < 0) break;\n  \n      if (p1 >= 0 && nums1[p1] > nums2[p2]) {\n        nums1[i] = nums1[p1--];\n      } else {\n        nums1[i] = nums2[p2--];\n      }\n    }\n  };     <\/code><\/pre>\n        <\/div>\n\n        <!-- Python -->\n        <div class=\"wp_blog_code-tab-content\" data-lang=\"py\">\n            <pre><code class=\"language-python\">\nclass Solution:\n    def merge(self, nums1, m, nums2, n):\n      p1 = m - 1\n      p2 = n - 1\n      i = m + n - 1\n  \n      while p2 >= 0:\n        if p1 >= 0 and nums1[p1] > nums2[p2]:\n          nums1[i] = nums1[p1]\n          p1 -= 1\n        else:\n          nums1[i] = nums2[p2]\n          p2 -= 1\n        i -= 1\n            <\/code><\/pre>\n        <\/div>\n\n        <!-- Java -->\n        <div class=\"wp_blog_code-tab-content\" data-lang=\"java\">\n            <pre><code class=\"language-java\">\nclass Solution {\n    public void merge(int[] nums1, int m, int[] nums2, int n) {\n      int p1 = m - 1;\n      int p2 = n - 1;\n      int i = m + n - 1;\n  \n      while (p2 >= 0) {\n        if (p1 >= 0 && nums1[p1] > nums2[p2]) {\n          nums1[i--] = nums1[p1--];\n        } else {\n          nums1[i--] = nums2[p2--];\n        }\n      }\n    }\n  }       <\/code><\/pre>\n        <\/div>\n\n        <!-- C++ -->\n        <div class=\"wp_blog_code-tab-content\" data-lang=\"cpp\">\n            <pre><code class=\"language-cpp\">\nclass Solution {\n  public:\n    void merge(vector& nums1, int m, vector& nums2, int n) {\n      int p1 = m - 1;\n      int p2 = n - 1;\n      int i = m + n - 1;\n  \n      while (p2 >= 0) {\n        if (p1 >= 0 && nums1[p1] > nums2[p2]) {\n          nums1[i--] = nums1[p1--];\n        } else {\n          nums1[i--] = nums2[p2--];\n        }\n      }\n    }\n  };   <\/code><\/pre>\n        <\/div>\n\n        <!-- C -->\n        <div class=\"wp_blog_code-tab-content\" data-lang=\"c\">\n            <pre><code class=\"language-c\">\n  void merge(int* nums1, int nums1Size, int m, int* nums2, int nums2Size, int n) {\n    int p1 = m - 1;\n    int p2 = n - 1;\n    int i = m + n - 1;\n  \n    while (p2 >= 0) {\n      if (p1 >= 0 && nums1[p1] > nums2[p2]) {\n        nums1[i--] = nums1[p1--];\n      } else {\n        nums1[i--] = nums2[p2--];\n      }\n    }\n  }\n<\/code><\/pre>\n        <\/div>\n\n        <!-- C# -->\n        <div class=\"wp_blog_code-tab-content\" data-lang=\"cs\">\n            <pre><code class=\"language-csharp\">\npublic class Solution {\n    public void Merge(int[] nums1, int m, int[] nums2, int n) {\n        int p1 = m - 1;\n        int p2 = n - 1;\n        int i = m + n - 1;\n\n        while (p2 >= 0) {\n            if (p1 >= 0 && nums1[p1] > nums2[p2]) {\n                nums1[i--] = nums1[p1--];\n            } else {\n                nums1[i--] = nums2[p2--];\n            }\n        }\n    }\n}        <\/code><\/pre>\n        <\/div>\n    <\/div>\n<\/div>\n\n<script>\n    document.addEventListener(\"DOMContentLoaded\", () => {\n        const buttons = document.querySelectorAll(\".wp_blog_code-tab-button\");\n        const contents = document.querySelectorAll(\".wp_blog_code-tab-content\");\n\n        buttons.forEach((button) => {\n            button.addEventListener(\"click\", () => {\n                const lang = button.getAttribute(\"data-lang\");\n\n                buttons.forEach((btn) => btn.classList.remove(\"active\"));\n                contents.forEach((content) =>\n                    content.classList.remove(\"active\")\n                );\n\n                button.classList.add(\"active\");\n                document\n                    .querySelector(`.wp_blog_code-tab-content[data-lang=\"${lang}\"]`)\n                    .classList.add(\"active\");\n            });\n        });\n    });\n<\/script>\n","protected":false},"excerpt":{"rendered":"<p>Problem Statement: You are given two integer arrays nums1 and nums2, sorted in non-decreasing order, and two integers m and n, representing the number of elements in nums1 and nums2 respectively. Mergenums1 and nums2 into a single array sorted in non-decreasing order. The final sorted array should not be returned by the function, but instead<\/p>\n","protected":false},"author":108,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"om_disable_all_campaigns":false,"_monsterinsights_skip_tracking":false,"_monsterinsights_sitenote_active":false,"_monsterinsights_sitenote_note":"","_monsterinsights_sitenote_category":0,"footnotes":""},"categories":[322,260,176,175,212,211,811,810,174,172,173],"tags":[],"class_list":{"0":"post-7342","1":"post","2":"type-post","3":"status-publish","4":"format-standard","6":"category-algorithms-and-data-structures","7":"category-c-c-plus-plus","8":"category-csharp","9":"category-cplusplus","10":"category-code-optimization","11":"category-data-structures","12":"category-data-structures-and-algorithms","13":"category-dsa","14":"category-java","15":"category-javascript","16":"category-python"},"aioseo_notices":[],"_links":{"self":[{"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/posts\/7342","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/users\/108"}],"replies":[{"embeddable":true,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/comments?post=7342"}],"version-history":[{"count":3,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/posts\/7342\/revisions"}],"predecessor-version":[{"id":10161,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/posts\/7342\/revisions\/10161"}],"wp:attachment":[{"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/media?parent=7342"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/categories?post=7342"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/tags?post=7342"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}