# (LeetCode) 88. Merge Sorted Array

## 88. Merge Sorted Array

• Explore : Interview > Top Interveiw Questions > Easy Collection
• 분류 : Sorting and Searching
• 난이도 : Easy

### Problem

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.

#### Constraints

• nums1.length == m + n
• nums2.length == n
• 0 <= m, n <= 200
• 1 <= m + n <= 200
• -10^9 <= nums1[i], nums2[j] <= 10^9

### Solution

Exapnder

#### Point of Thinking

• num1은 오름차순으로 정렬되어있고, m값은 채워야할 숫자이므로 빈 공간에 num2의 값을 채운 후 정렬하면 Accepted.