数据结构--线性表顺序存储(二)
ist = DesList->base;
DesList->length = list_a->length + list_b->length;
if (DesList->listsize < DesList->length)//存储空间 大小 检测
{
DesList->listsize = DesList->length = list_a->length + list_b->length;
if(NULL == (DesList->base = (ElemType *)realloc(DesList->base, DesList->listsize * sizeof(ElemType))))
return ERROR;
P_list = DesList->base;
}
while( (Pb <= Pb_end)&&(Pa <= Pa_end) )
{
if (*Pa <= *Pb)
{
*P_list++ = *Pa++;
}
else
{
*P_list++ = *Pb++;
}
}
while (Pa <= Pa_end)
{
*P_list++ = *Pa++;
}
while (Pb <= Pb_end)
{
*P_list++ = *Pb++;
}
return OK;
}