在Java中递归合并两个有序数组

public class MergeSortedArrays {
    public static int[] mergeArrays(int[] arr1, int[] arr2) {
        int[] mergedArray = new int[arr1.length + arr2.length];
        mergeArraysHelper(arr1, arr2, mergedArray, 0, 0, 0);
        return mergedArray;
    }

    private static void mergeArraysHelper(int[] arr1, int[] arr2, int[] mergedArray, int index1, int index2, int mergedIndex) {
        if (index1 == arr1.length) {
            // arr1的所有元素都已合并
            while (index2 < arr2.length) {
                mergedArray[mergedIndex++] = arr2[index2++];
            }
            return;
        }
        if (index2 == arr2.length) {
            // arr2的所有元素都已合并
            while (index1 < arr1.length) {
                mergedArray[mergedIndex++] = arr1[index1++];
            }
            return;
        }
        if (arr1[index1] < arr2[index2]) {
            // 将较小的元素放入新数组中，并递归合并剩余元素
            mergedArray[mergedIndex] = arr1[index1];
            mergeArraysHelper(arr1, arr2, mergedArray, index1 + 1, index2, mergedIndex + 1);
        } else {
            mergedArray[mergedIndex] = arr2[index2];
            mergeArraysHelper(arr1, arr2, mergedArray, index1, index2 + 1, mergedIndex + 1);
        }
    }

    public static void main(String[] args) {
        int[] arr1 = {1, 3, 5, 7};
        int[] arr2 = {2, 4, 6, 8};
        int[] mergedArray = mergeArrays(arr1, arr2);
        System.out.println(Arrays.toString(mergedArray));
    }
}