LeetCode: Merge Sorted Array

LeetCode: Merge Sorted Array

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31

/**
* Description:
*
* @author hzhou
*/
public class MergeSortedArray {
public void merge(int[] nums1, int m, int[] nums2, int n) {
int i = m - 1;
while (i >= 0) {
nums1[n + i] = nums1[i];
i--;
}
int a = n;
int b = 0;
i = 0;
while (a < m + n && b < n) {
if (nums1[a] <= nums2[b]) {
nums1[i++] = nums1[a++];
} else {
nums1[i++] = nums2[b++];
}
}
while (a < m + n) {
nums1[i++] = nums1[a++];
}
while (b < n) {
nums1[i++] = nums2[b++];
}
}
}