feat: add python and java solutions to leetcode problem: No.0088

See https://leetcode-cn.com/problems/merge-sorted-array/

Author: yanglbme

README.md

@@ -54,6 +54,7 @@
 1. [旋转数组](/solution/0100-0199/0189.Rotate%20Array/README.md)
 1. [三数之和](/solution/0000-0099/0015.3Sum/README.md)
 1. [四数之和](/solution/0000-0099/0018.4Sum/README.md)
+1. [合并两个有序数组](/solution/0000-0099/0088.Merge%20Sorted%20Array/README.md)
 
 ### 字符串
 

README_EN.md

@@ -53,6 +53,7 @@ Complete solutions to [LeetCode](https://leetcode-cn.com/problemset/all/), [LCOF
 1. [Rotate Array](/solution/0100-0199/0189.Rotate%20Array/README_EN.md)
 1. [3Sum](/solution/0000-0099/0015.3Sum/README_EN.md)
 1. [4Sum](/solution/0000-0099/0018.4Sum/README_EN.md)
+1. [Merge Sorted Array](/solution/0000-0099/0088.Merge%20Sorted%20Array/README_EN.md)
 
 ### Strings
 

solution/0000-0099/0088.Merge Sorted Array/README.md

@@ -30,22 +30,50 @@ nums2 = [2,5,6],       n = 3
 
 <!-- 这里可写通用的实现逻辑 -->
 
+双指针解决。
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def merge(self, nums1: List[int], m: int, nums2: List[int], n: int) -> None:
+        """
+        Do not return anything, modify nums1 in-place instead.
+        """
+        i, j = m - 1, n - 1
+        k = m + n - 1
+        while j >= 0:
+            if i >= 0 and nums1[i] > nums2[j]:
+                nums1[k] = nums1[i]
+                i -= 1
+            else:
+                nums1[k] = nums2[j]
+                j -= 1
+            k -= 1
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public void merge(int[] nums1, int m, int[] nums2, int n) {
+        int i = m - 1, j = n - 1;
+        int k = m + n - 1;
+        while (j >= 0) {
+            if (i >= 0 && nums1[i] >= nums2[j]) {
+                nums1[k--] = nums1[i--];
+            } else {
+                nums1[k--] = nums2[j--];
+            }
+        }
+    }
+}
 ```
 
 ### **...**

solution/0000-0099/0088.Merge Sorted Array/README_EN.md

@@ -36,13 +36,39 @@ nums2 = [2,5,6],       n = 3
 ### **Python3**
 
 ```python
-
+class Solution:
+    def merge(self, nums1: List[int], m: int, nums2: List[int], n: int) -> None:
+        """
+        Do not return anything, modify nums1 in-place instead.
+        """
+        i, j = m - 1, n - 1
+        k = m + n - 1
+        while j >= 0:
+            if i >= 0 and nums1[i] > nums2[j]:
+                nums1[k] = nums1[i]
+                i -= 1
+            else:
+                nums1[k] = nums2[j]
+                j -= 1
+            k -= 1
 ```
 
 ### **Java**
 
 ```java
-
+class Solution {
+    public void merge(int[] nums1, int m, int[] nums2, int n) {
+        int i = m - 1, j = n - 1;
+        int k = m + n - 1;
+        while (j >= 0) {
+            if (i >= 0 && nums1[i] >= nums2[j]) {
+                nums1[k--] = nums1[i--];
+            } else {
+                nums1[k--] = nums2[j--];
+            }
+        }
+    }
+}
 ```
 
 ### **...**

solution/0000-0099/0088.Merge Sorted Array/Solution.java

@@ -1,12 +1,13 @@
 class Solution {
     public void merge(int[] nums1, int m, int[] nums2, int n) {
-        int index = m+n-1;
-        int index1 = m-1;
-        int index2 = n-1;
-        while(index1>=0&&index2>=0){
-            if (nums1[index1]<nums2[index2]) nums1[index--] = nums2[index2--];
-            else nums1[index--] = nums1[index1--];
+        int i = m - 1, j = n - 1;
+        int k = m + n - 1;
+        while (j >= 0) {
+            if (i >= 0 && nums1[i] >= nums2[j]) {
+                nums1[k--] = nums1[i--];
+            } else {
+                nums1[k--] = nums2[j--];
+            }
         }
-        while(index2>=0) nums1[index--] = nums2[index2--];
     }
 }

solution/0000-0099/0088.Merge Sorted Array/Solution.py

@@ -0,0 +1,15 @@
+class Solution:
+    def merge(self, nums1: List[int], m: int, nums2: List[int], n: int) -> None:
+        """
+        Do not return anything, modify nums1 in-place instead.
+        """
+        i, j = m - 1, n - 1
+        k = m + n - 1
+        while j >= 0:
+            if i >= 0 and nums1[i] > nums2[j]:
+                nums1[k] = nums1[i]
+                i -= 1
+            else:
+                nums1[k] = nums2[j]
+                j -= 1
+            k -= 1