add 088

Author: shishishu

README.md

@@ -41,4 +41,5 @@ Idx | Date | Question | Python| Java | Domain | Tag | Difficulty | Remark
 035|20200406|[95. Unique Binary Search Trees II](https://leetcode.com/problems/unique-binary-search-trees-ii/)|[095p](https://github.com/shishishu/leetcode-python-java/blob/master/ipynb_files/095_Unique_Binary_Search_Trees_II.ipynb)|[095j](https://github.com/shishishu/leetcode-python-java/blob/master/java_codes/095/Solution.java)|BST|DP|Medium
 036|20200419|[912. Sort an Array](https://leetcode.com/problems/sort-an-array/)|[912p](https://github.com/shishishu/leetcode-python-java/blob/master/ipynb_files/912_Sort_an_Array.ipynb)|[912j](https://github.com/shishishu/leetcode-python-java/blob/master/java_codes/912/Solution.java)|List|Sort|Medium
 037|20200419|[540. Single Element in a Sorted Array](https://leetcode.com/problems/single-element-in-a-sorted-array/)|[540p](https://github.com/shishishu/leetcode-python-java/blob/master/ipynb_files/540_Single_Element_in_a_Sorted_Array.ipynb)|[540j](https://github.com/shishishu/leetcode-python-java/blob/master/java_codes/540/Solution.java)|List|Search|Medium
+038|20200419|[88. Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array/)|[088p](https://github.com/shishishu/leetcode-python-java/blob/master/ipynb_files/088_Merge_Sorted_Array.ipynb)|[088j](https://github.com/shishishu/leetcode-python-java/blob/master/java_codes/088/Solution.java)|List| |Easy
 

images/088_Q.PNG

@@ -0,0 +1,29 @@
+class Solution {
+    public void merge(int[] nums1, int m, int[] nums2, int n) {
+        while (m > 0 && n > 0){
+            if (nums1[m-1] >= nums2[n-1]){
+                nums1[m+n-1] = nums1[m-1];
+                m--;
+            } else{
+                nums1[m+n-1] = nums2[n-1];
+                n--;
+            }
+        }
+        while (n > 0){
+            n--;
+            nums1[n--] = nums2[n--];
+        }
+    }
+}
+
+class Solution {
+    public void merge(int[] nums1, int m, int[] nums2, int n) {
+        int i = m - 1, j = n - 1, k = m + n - 1;
+        while (i > -1 && j > -1){
+            nums1[k--] = (nums1[i] >= nums2[j]) ? nums1[i--] : nums2[j--];
+        }
+        while (j > -1){
+            nums1[k--] = nums2[j--];
+        }
+    }
+}

images/088_S1.PNG

@@ -41,6 +41,7 @@
       <sourceFolder url="file://$MODULE_DIR$/095" isTestSource="false" />
       <sourceFolder url="file://$MODULE_DIR$/912" isTestSource="false" />
       <sourceFolder url="file://$MODULE_DIR$/540" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/088" isTestSource="false" />
     </content>
     <orderEntry type="inheritedJdk" />
     <orderEntry type="sourceFolder" forTests="false" />