JAVA/leetcode
[LeetCode] Array - Merge Sorted Array
JJunDol2
2021. 8. 5. 16:18
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);
}
}