剑指offer5.1——O（n）的复杂度合并两个有序数组

#include"iostream"
#include"stdio.h"
using namespace std;

int* ArrayMerge(int *a,int aLen,int  *b,int bLen)
{
    int aIndex=aLen-1,bIndex=bLen-1,newIndex=aLen+bLen-1;

    while(aIndex>=0&&bIndex>=0)
    {
        if(a[aIndex]>b[bIndex])
        {
            a[newIndex--]=a[aIndex--];
        }
        else
        {
            a[newIndex--]=b[bIndex--];
        }
    }
    while(aIndex>=0)
    {
        a[newIndex--]=a[aIndex--];
    }
    while(bIndex>=0)
    {
        a[newIndex--]=b[bIndex--];
    }
    return a;
}

void Test(char *testName,int *a,int aLen,int *b,int bLen,int *res,int aMaxLen)
{
    if(testName!=nullptr)
        cout<<"the "<<testName<<" begin:";
    if(aLen+bLen>aMaxLen)
    {
        cout<<"out of range!"<<endl;
        return;
    }
    if(a==nullptr || b==nullptr)
    {
        cout<<"the one of two arrays is NULL!"<<endl;
        return;
    }
    if(aLen<0 || bLen<0)
    {
        cout<<"error input"<<endl;
        return;
    }
    int *getRes=ArrayMerge(a,aLen,b,bLen);
    int i;
    for(i=0;i<aLen+bLen;i++)
    {
      //  cout<<getRes[i]<<" ";
        if(res[i]!=getRes[i]) break;
    }
    if(i<aLen+bLen)
        cout<<"failed!"<<endl;
    else
        cout<<"passed!"<<endl;
}

//a数组全排在b数组前面
void Test1()
{
    int a[100]={1,2,3};//一定要指定a数组的大小
    int b[]={4,5,6};
    int res[]={1,2,3,4,5,6};
    Test("Test1",a,3,b,3,res,100);
}
//a数组和b数组混合
void Test2()
{
    int a[100]={1,4,5};
    int b[]={2,3,6};
    int res[]={1,2,3,4,5,6};
    Test("Test2",a,3,b,3,res,100);
}
//a数组为空
void Test3()
{
    int a[100]={};
    int b[]={2,3,6};
    int res[]={2,3,6};
    Test("Test3",a,0,b,3,res,100);
}
//b数组为空
void Test4()
{
    int b[]={};
    int a[100]={2,3,6};
    int res[]={2,3,6};
    Test("Test4",a,3,b,0,res,100);
}

//a、b数组为空
void Test5()
{
    int a[100]={};
    int b[]={};
    int res[]={};
    Test("Test5",a,0,b,0,res,100);
}
//a、b数组为空
void Test6()
{
    int *a=nullptr;
    int b[]={};
    int res[]={};
    Test("Test6",a,0,b,0,res,100);
}
int main()
{
    Test1();
    Test2();
    Test3();
    Test4();
    Test5();
    Test6();
    return 0;
}