Add solution #88

Author: JoshCrozier

README.md

@@ -28,6 +28,7 @@
 58|[Length of Last Word](./0058-length-of-last-word.js)|Easy|
 66|[Plus One](./0066-plus-one.js)|Easy|
 67|[Add Binary](./0067-add-binary.js)|Easy|
+88|[Merge Sorted Array](./0088-merge-sorted-array.js)|Easy|
 151|[Reverse Words in a String](./0151-reverse-words-in-a-string.js)|Medium|
 152|[Maximum Product Subarray](./0152-maximum-product-subarray.js)|Medium|
 217|[Contains Duplicate](./0217-contains-duplicate.js)|Easy|

solutions/0088-merge-sorted-array.js

@@ -0,0 +1,34 @@
+/**
+ * 88. Merge Sorted Array
+ * https://leetcode.com/problems/merge-sorted-array/
+ * Difficulty: Easy
+ *
+ * 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.
+ *
+ * Merge `nums1` and `nums2` into a single array sorted in non-decreasing order.
+ *
+ * The final sorted array should not be returned by the function, but instead be
+ * stored inside the array `nums1`. To accommodate this, `nums1` has a length of `m + n`,
+ * where the first `m` elements denote the elements that should be merged, and the
+ * last `n` elements are set to `0` and should be ignored. `nums2` has a length of `n`.
+ */
+
+/**
+ * @param {number[]} nums1
+ * @param {number} m
+ * @param {number[]} nums2
+ * @param {number} n
+ * @return {void} Do not return anything, modify nums1 in-place instead.
+ */
+var merge = function(nums1, m, nums2, n) {
+  let i = m + n - 1;
+
+  m--;
+  n--;
+
+  while (n >= 0) {
+    nums1[i--] = nums1[m] > nums2[n] ? nums1[m--] : nums2[n--];
+  }
+};