Question

数据结构问题，求将两个升序列表A B合成一个新的升序列表C的算法。求大神帮助！好人一生平安！！

Answer 1

public static int[]merge(int a[],int b[]){
//特殊情况
    if(a==null||b==null){
        return null;
    }
    if(a.length==0){
        return b;
    }
    if(b.length==0){
        return a;
    }
    int []c= new int[a.length+b.length];
    int indexA=0,indexB=0,indexC=0;
    while(indexA<a.length&&indexB<b.length){
        if(a[indexA]<=b[indexB]){
            c[indexC]=a[indexA];
            indexC++;
            indexA++;
        }
        else{
            c[indexC]=b[indexB];
            indexC++;
            indexB++;
        }
    }
    while(indexA<a.length){
        c[indexC]=a[indexA];
        indexA++;
        indexC++;
    }
    while(indexB<a.length){
        c[indexC]=b[indexB];
        indexB++;
        indexC++;
    }
    return c;  
}