Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.
Note:
- The number of elements initialized in nums1 and nums2 are m and n respectively.
- You may assume that nums1 has enough space (size that is greater or equal to m + n) to hold additional elements from nums2.
Example:
1
2
3
4
5
|
Input:
nums1 = [1,2,3,0,0,0], m = 3
nums2 = [2,5,6], n = 3
Output: [1,2,2,3,5,6]
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
|
class {
public void merge(int[] nums1, int m, int[] nums2, int n) {
if (nums1 == null || nums2 == null)
return;
int index = m + n -1;
while (m > 0 && n > 0) {
if (nums1[m - 1] > nums2[n - 1]) {
nums1[index] = nums1[m - 1];
m--;
} else {
nums1[index] = nums2[n - 1];
n--;
}
index--;
}
while (n > 0) {
nums1[index] = nums2[n - 1];
n--;
index--;
}
}
}
|
近期评论