Leetcode Javascript 88: Merge Sorted Array

Leetcode Javascript 88: Merge Sorted Array is a popular problem in the field of coding and algorithmic problems on the Leetcode platform. In this tutorial, we will provide an easy explanation of the problem and its solution using Javascript.

Problem Statement

The problem statement of Leetcode Javascript 88: Merge Sorted Array is as follows:

Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.

The input arrays nums1 and nums2 have m and n elements respectively. You may assume that nums1 has enough space to hold additional elements from nums2.

Example

Here’s an example to illustrate the problem:

Input:
nums1 = [1,2,3,0,0,0], m = 3
nums2 = [2,5,6], n = 3

Output: [1,2,2,3,5,6]

Explanation

From the given example, we can see that nums1 has enough space to hold the additional elements from nums2. The merged sorted array should be [1,2,2,3,5,6].

Solution

Here’s a possible solution to the problem using Javascript:

var merge = function(nums1, m, nums2, n) {
  let i = m - 1;
  let j = n - 1;
  let k = m + n - 1;

  while (i >= 0 && j >= 0) {
    if (nums1[i] > nums2[j]) {
      nums1[k] = nums1[i];
      i--;
    } else {
      nums1[k] = nums2[j];
      j--;
    }
    k--;
  }

  while (j >= 0) {
    nums1[k] = nums2[j];
    k--;
    j--;
  }
};

Conclusion

In this tutorial, we have explained the Leetcode Javascript 88: Merge Sorted Array problem and provided an easy explanation and solution using Javascript. With practice and understanding of the problem, you can master this algorithmic problem and improve your coding skills.