37 lines
887 B
Java
37 lines
887 B
Java
class Solution {
|
|
public static void main(String[] args) {
|
|
int[] nums1 = {1,2,3,0,0,0};
|
|
int[] nums2 = {2,5,6};
|
|
merge(nums1, 3, nums2, 3);
|
|
for (Object object :nums1) {
|
|
System.out.println(object);
|
|
}
|
|
|
|
}
|
|
|
|
public static void merge(int[] nums1, int m, int[] nums2, int n) {
|
|
int j = 0;
|
|
for (int i = 0; i < nums1.length && j < n; i++) {
|
|
if (nums1[i] <= nums2[j]) {
|
|
continue;
|
|
}
|
|
insert(nums1, nums2[j], i);
|
|
j++;
|
|
i--;
|
|
}
|
|
|
|
}
|
|
|
|
static void insert(int[] nums, int num, int pos) {
|
|
if (pos == nums.length - 1) {
|
|
nums[pos] = num;
|
|
return;
|
|
}
|
|
|
|
for (int i = pos; i < nums.length; i++) {
|
|
int temp = nums[i];
|
|
nums[i] = num;
|
|
num = temp;
|
|
}
|
|
}
|
|
} |