数组合并问题

import java.util.Arrays;
public class MergeArray {
    public static int[] mergeSortArray(int[] a,int[] b){
        //创建数组大小为两个待合并数组的长度之和
        int[] arr = new int[a.length+b.length];
        int temp = 0, i = 0, j = 0;
        //判断a或b数组的元素是否已经全部添加进临时数组中
        while (i != a.length && j != b.length){
            if (a[i] >= b[j]){
                arr[temp++] = b[j++];
            }else {
                arr[temp++] = a[i++];
            }
        }
        //判断a数组是否完全添加进去临时数组中 若a数组还有元素还没添加进去则将a数组剩下的元素添加进临时数组中
        if (i != a.length){
            while (i != a.length){
                arr[temp++] = a[i++];
            }
        }
        if (j != b.length){
            while (j != b.length){
                arr[temp++] = b[j++];
            }
        }
        return arr;
    }
    public static void main(String[] args) {
        int[] A = {1,2,3,4};
        int[] B = {2,3,4,5,6,8};
        System.out.println(Arrays.toString(mergeSortArray(A,B)));
    }
}

结果:

[1, 2, 2, 3, 3, 4, 4, 5, 6, 8]