merge

Author: liuhanqu

algorithms/easy/merge/merge.js

@@ -0,0 +1,25 @@
+// description: https://leetcode-cn.com/explore/interview/card/top-interview-questions-easy/8/sorting-and-searching/52/
+// 合并两个有序数组
+
+/**
+ * @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) {
+  var i = m - 1;
+  var j = n - 1;
+  var k = m + n - 1;
+  while (i >= 0 && j >= 0) {
+    if (nums1[i] > nums2[j]) {
+      nums1[k--] = nums1[i--];
+    } else {
+      nums1[k--] = nums2[j--];
+    }
+  }
+  while (j >= 0) {
+    nums1[k--] = nums2[j--];
+  }
+};