문제
Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.
The number of elements initialized in nums1 and nums2 are m and n respectively. You may assume that nums1 has a size equal to m + n such that it has enough space to hold additional elements from nums2.
정수 배열 2개가 주어질 때 두 배열을 정렬된 하나의 배열로 합쳐라.
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]Example 2:
Input: nums1 = [1], m = 1, nums2 = [], n = 0
Output: [1]Constraints:
nums1.length == m + n
nums2.length == n
0 <= m, n <= 200
1 <= m + n <= 200
-10^9 <= nums1[i], nums2[i] <= 10^9
Solution
class Solution {
public void merge(int[] nums1, int m, int[] nums2, int n) {
if (n!=0){
for (int i = 0; m<nums1.length; i++){
nums1[m] = nums2[i];
m++;
}
}
Arrays.sort(nums1);
}
}