class Solution {
public void merge(int[] nums1, int m, int[] nums2, int n) {
for (int i = 0; i < nums2.length; i++) {
nums1[i+m] = nums2[i];
}
Arrays.sort(nums1);
}
}
'JAVA > leetcode' 카테고리의 다른 글
[LeetCode] Array - Remove Duplicates from Sorted Array !! (0) | 2021.08.05 |
---|---|
[LeetCode] Array - Remove Element !! (0) | 2021.08.05 |
[LeetCode] Array - Duplicate Zeros !! (0) | 2021.08.05 |
[LeetCode] Array - Squares of a Sorted Array (0) | 2021.08.05 |
[LeetCode] Array - Find Numbers with Even Number of Digits (0) | 2021.08.04 |