1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
class Solution {
    public void merge(int[] nums1, int m, int[] nums2, int n) {
        if (n == 0)
            return;
        int[] nums3 = new int[m + n];
        int i = 0, x = 0, y = 0;
        while (x < m && y < n) {
            nums3[i++] = (nums1[x] <= nums2[y]) ? nums1[x++] : nums2[y++];
        }
        while (x < m)
            nums3[i++] = nums1[x++];
        while (y < n)
            nums3[i++] = nums2[y++];
        for (int j = 0; j < (m + n); j++) {
            nums1[j] = nums3[j];
        }
    }
}