solve problem Merge Sorted Array

Author: P-ppc

README.md

@@ -69,6 +69,7 @@ All solutions will be accepted!
 |566|[Reshape The Matrix](https://leetcode-cn.com/problems/reshape-the-matrix/description/)|[java/py/js](./algorithms/ReshapeTheMatrix)|Easy|
 |575|[Distribute Candies](https://leetcode-cn.com/problems/distribute-candies/description/)|[java/py/js](./algorithms/DistributeCandies)|Easy|
 |21|[Merge Two Sorted Lists](https://leetcode-cn.com/problems/merge-two-sorted-lists/description/)|[java/py/js](./algorithms/MergeTwoSortedLists)|Easy|
+|88|[Merge Sorted Array](https://leetcode-cn.com/problems/merge-sorted-array/description/)|[java/py/js](./algorithms/MergeSortedArray)|Easy|
 
 # Database
 |#|Title|Solution|Difficulty|

algorithms/MergeSortedArray/README.md

@@ -0,0 +1,2 @@
+# Merge Sorted Array
+This problem is easy to solve by two linked list

algorithms/MergeSortedArray/Solution.java

@@ -0,0 +1,23 @@
+class Solution {
+    public void merge(int[] nums1, int m, int[] nums2, int n) {
+        int[] nums1Copy = new int[m];
+        System.arraycopy(nums1, 0, nums1Copy, 0, m);
+        
+        int i = 0, j = 0;
+        while (i < m && j < n) {
+            nums1[i + j] = Math.min(nums1Copy[i], nums2[j]);
+            if (nums1Copy[i] <= nums2[j]) i++;
+            else j++;
+        }
+        
+        while (i < m) {
+            nums1[i + j] = nums1Copy[i];
+            i++;
+        }
+        
+        while (j < n) {
+            nums1[i + j] = nums2[j];
+            j++;
+        }
+    }
+}

algorithms/MergeSortedArray/solution.js

@@ -0,0 +1,31 @@
+/**
+ * @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 nums1Copy = []
+    for (let i = 0; i < m; i++) {
+        nums1Copy.push(nums1[i])
+    }
+    
+    let i = j = 0
+        
+    while (i < m && j < n) {
+        nums1[i + j] = Math.min(nums1Copy[i], nums2[j])
+        if (nums1Copy[i] <= nums2[j]) i++
+        else j++
+    }
+    
+    while (i < m) {
+        nums1[i + j] = nums1Copy[i]
+        i++
+    }
+    
+    while (j < n) {
+        nums1[i + j] = nums2[j]
+        j++
+    }
+};

algorithms/MergeSortedArray/solution.py

@@ -0,0 +1,29 @@
+class Solution(object):
+    def merge(self, nums1, m, nums2, n):
+        """
+        :type nums1: List[int]
+        :type m: int
+        :type nums2: List[int]
+        :type n: int
+        :rtype: void Do not return anything, modify nums1 in-place instead.
+        """
+        nums1_copy = []
+        for i in range(0, m):
+            nums1_copy.append(nums1[i])
+        
+        i = 0
+        j = 0
+        while i < m and j < n:
+            nums1[i + j] = min(nums1_copy[i], nums2[j])
+            if nums1_copy[i] <= nums2[j]:
+                i += 1
+            else:
+                j += 1
+        
+        while i < m:
+            nums1[i + j] = nums1_copy[i]
+            i += 1
+        while j < n:
+            nums1[i + j] = nums2[j]
+            j += 1
+