sorted int[] 2개 머지

 

혹시 TreeMap TreeSet에서 element가 primitive일때 reverseOrder로 간단히 하려면.

TreeMap<Integer,Integer> tm = new TreeMap<>(Collections.reverseOrder());

 

  public static int[] mergeSortedArrays(int[] arr1, int[] arr2) {
        int[] result = new int[arr1.length + arr2.length];
        int i = 0, j = 0, k = 0;

        while (i < arr1.length && j < arr2.length) {
            if (arr1[i] < arr2[j]) {
                result[k++] = arr1[i++];
            } else {
                result[k++] = arr2[j++];
            }
        }

        while (i < arr1.length) {
            result[k++] = arr1[i++];
        }

        while (j < arr2.length) {
            result[k++] = arr2[j++];
        }

        return result;
    }
}