[Easy] Title: 88. Merge Sorted Array - LeetCode

Author: JinHyung-dev

LeetCode/Easy/88. Merge Sorted Array/Merge Sorted Array.java

@@ -0,0 +1,23 @@
+class Solution {
+    public void merge(int[] nums1, int m, int[] nums2, int n) {
+        int i = m-1; //1배열의 유효값 마지막 인덱스(최대값)
+        int j = n-1; //2배열의 유효값 마지막 인덱스(최대값)
+        int k = m + n - 1; //최종 병합된 1배열의 마지막 인덱스
+
+        while(i >= 0 && j >= 0) {
+            //1배열의 최대값이 2배열의 최대값보다 클때
+            if(nums1[i] > nums2[j]) {
+                //1배열 최대값을 빈 공간으로 이동 후 1배열 포인터만 이동
+                nums1[k--] = nums1[i--];
+            } else {
+                // 1배열의 최대값이 2배열 최대값보다 작을때
+                nums1[k--] = nums2[j--];
+            }
+        }
+
+        // 2배열 값이 남아있을 경우 추가 병합
+        while(j >= 0) {
+            nums1[k--] = nums2[j--];
+        }
+    }
+}

LeetCode/Easy/88. Merge Sorted Array/README.md

@@ -0,0 +1,44 @@
+# [Easy] 125. Valid Palindrome 
+
+[문제 링크](https://leetcode.com/problems/merge-sorted-array/)
+
+### 문제 설명
+You are given two integer arrays nums1 and nums2, sorted in non-decreasing order, and two integers m and n, representing the number of elements in nums1 and nums2 respectively.
+
+Merge nums1 and nums2 into a single array sorted in non-decreasing order.
+
+The final sorted array should not be returned by the function, but instead be stored inside the array nums1. To accommodate this, nums1 has a length of m + n, where the first m elements denote the elements that should be merged, and the last n elements are set to 0 and should be ignored. nums2 has a length of n.
+
+### 입출력
+Example 1:
+```
+Input: nums1 = [1,2,3,0,0,0], m = 3, nums2 = [2,5,6], n = 3
+Output: [1,2,2,3,5,6]
+```
+Explanation: The arrays we are merging are [1,2,3] and [2,5,6].
+The result of the merge is [1,2,2,3,5,6] with the underlined elements coming from nums1.
+
+Example 2:
+```
+Input: nums1 = [1], m = 1, nums2 = [], n = 0
+Output: [1]
+```
+Explanation: The arrays we are merging are [1] and [].
+The result of the merge is [1].
+
+Example 3:
+```
+Input: nums1 = [0], m = 0, nums2 = [1], n = 1
+Output: [1]
+```
+Explanation: The arrays we are merging are [] and [1].
+The result of the merge is [1].
+Note that because m = 0, there are no elements in nums1. The 0 is only there to ensure the merge result can fit in nums1.
+
+### 문제설명
+Constraints:
+- nums1.length == m + n
+- nums2.length == n
+- 0 <= m, n <= 200
+- 1 <= m + n <= 200
+- -109 <= nums1[i], nums2[j] <= 109