feat: add 088

Author: Blankj

.idea/encodings.xml

@@ -25,6 +25,7 @@
 |69|[Sqrt(x)][069]|Binary Search, Math|
 |70|[Climbing Stairs][070]|Dynamic Programming|
 |83|[Remove Duplicates from Sorted List][083]|Linked List|
+|88|[Merge Sorted Array][088]|Array, Two Pointers|
 
 
 ## Medium
@@ -47,13 +48,12 @@
 
 [project]: https://github.com/Blankj/awesome-java-leetcode/tree/master/project
 [note]: https://github.com/Blankj/awesome-java-leetcode/tree/master/note
+
 [001]: https://github.com/Blankj/awesome-java-leetcode/blob/master/note/001/README.md
 [007]: https://github.com/Blankj/awesome-java-leetcode/blob/master/note/007/README.md
-[008]: https://github.com/Blankj/awesome-java-leetcode/blob/master/note/008/README.md
 [009]: https://github.com/Blankj/awesome-java-leetcode/blob/master/note/009/README.md
 [013]: https://github.com/Blankj/awesome-java-leetcode/blob/master/note/013/README.md
 [014]: https://github.com/Blankj/awesome-java-leetcode/blob/master/note/014/README.md
-[019]: https://github.com/Blankj/awesome-java-leetcode/blob/master/note/019/README.md
 [020]: https://github.com/Blankj/awesome-java-leetcode/blob/master/note/020/README.md
 [021]: https://github.com/Blankj/awesome-java-leetcode/blob/master/note/021/README.md
 [026]: https://github.com/Blankj/awesome-java-leetcode/blob/master/note/026/README.md
@@ -68,3 +68,7 @@
 [069]: https://github.com/Blankj/awesome-java-leetcode/blob/master/note/069/README.md
 [070]: https://github.com/Blankj/awesome-java-leetcode/blob/master/note/070/README.md
 [083]: https://github.com/Blankj/awesome-java-leetcode/blob/master/note/083/README.md
+[088]: https://github.com/Blankj/awesome-java-leetcode/blob/master/note/088/README.md
+
+[008]: https://github.com/Blankj/awesome-java-leetcode/blob/master/note/008/README.md
+[019]: https://github.com/Blankj/awesome-java-leetcode/blob/master/note/019/README.md

.idea/libraries/KotlinJavaRuntime.xml

@@ -0,0 +1,37 @@
+# [Merge Sorted Array][title]
+
+## Description
+
+Given two sorted integer arrays *nums1* and *nums2*, merge *nums2* into *nums1* as one sorted array.
+
+**Note:**
+You may assume that *nums1* has enough space (size that is greater or equal to *m* + *n*) to hold additional elements from *nums2*. The number of elements initialized in *nums1* and *nums2* are *m* and *n* respectively.
+
+**Tags:** Array, Two Pointers
+
+
+## 思路
+
+题意是给两个已排序的数组`nums1`和`nums2`，合并`nums2`到`nums1`中，两数组元素个数分别为`m`和`n`，而且`nums1`数组的长度足够容纳`m + n`个元素，如果我们按顺序排下去，那肯定要开辟一个新数组来保存覆盖的元素，所以我们选择逆序，这样利用`nums1`自身空间足矣，依次把大的元素插入到`nums1`的末尾，确保`nums2`中的元素全部插入到`nums1`即可。
+
+``` java
+public class Solution {
+    public void merge(int[] nums1, int m, int[] nums2, int n) {
+        int p = m-- + n-- - 1;
+        while (m >= 0 && n >= 0)
+            nums1[p--] = nums1[m] > nums2[n] ? nums1[m--] : nums2[n--];
+        while (n >= 0)
+            nums1[p--] = nums2[n--];
+    }
+}
+```
+
+
+## 结语
+
+如果你同我一样热爱数据结构、算法、LeetCode，可以关注我GitHub上的LeetCode题解：[awesome-java-leetcode][ajl]
+
+
+
+[title]: https://leetcode.com/problems/merge-sorted-array
+[ajl]: https://github.com/Blankj/awesome-java-leetcode