package LeetCode;

import java.util.Arrays;

public class LC_88 {
    public static void main(String[] args) {
        merge(new int[]{0}, 0, new int[]{1}, 1);
    }

    public static void merge(int[] nums1, int m, int[] nums2, int n) {
        int[] res = new int[m + n];
        int i = 0;
        int j = 0;
        int k = 0;
        while (i < n && j < m) {
            if (nums1[i] <= nums2[j]) {
                res[k++] = nums1[i++];
            } else res[k++] = nums2[j++];
        }
        if (j < n) {
            while (j < n && k < m + n) {
                res[k++] = nums2[j++];
            }
        } else if (i < m) {
            while (i < m && k < m + n) {
                res[k++] = nums1[i++];
            }
        }

        nums1 = res;
        System.out.println(Arrays.toString(res));
    }
}