字节2-1算法20210334 合并两个数组

两个有序的数组合并成一个数组
int [] a = {7};
int [] b = {2,3,4,6,8};  

预期：c={2,3,4,6,7,8}

public class JoinArray {
    public static void main(String[] args) {
        int [] a = {1};
        int [] b = {2,3,4,6,8};
        int [] c = new int[a.length+b.length];

        //a point
        int i = 0;
        //b point
        int j = 0;
        //c point
        int k = 0;

        while(k<a.length+b.length){
            Integer aInt = i>=a.length?null:a[i];
            Integer bInt = j>=b.length?null:b[j];
            //边界值
            //判断条件aInt<=bInt，新数组有序
            if(bInt == null && aInt == null){
                break;
            } else if((bInt == null)||(bInt!=null&&aInt!=null&&aInt<=bInt)){
                c[k++] = aInt;
                i++;
            }else if((aInt == null)||(bInt!=null&&aInt!=null&&aInt >bInt)){
                c[k++] = bInt;
                j++;
            }
        }
        System.out.println(c);
    }
}

输出结果：