合并两个有序数组

public static int[] MergeSort(int[] a, int[] b){
    if(a.length ==0 && b.length ==0){
        return null;
    }
    if(a.length == 0){
        return b;
    }
    if(b.length == 0 ){
        return a;
    }
    int t = a.length + b.length;
    int[] c = new int[t];
    int m = 0;
    int n = 0;
    for(int k = 0; k < t; k++){
        if(n== b.length  ){
            c[k] = a[m];
            m++;
        }else if(m == a.length){
            c[k] = b[n];
            n++;
        }else if( a[m] <= b[n] ){
            c[k] = a[m];
            m++;
        }else{
            c[k] = b[n];
            n++;
        }
    }
    return  c;
}