救命顺序链表的合并

int* mergesqulist(squlist &L1,squlist &L2)
{
int *k,len,*p,*q;
p=L1.base;
q=L2.base;
len=(L1.length)+(L2.length);
k=(int*)malloc(len*sizeof(int));
while(p!=NULL||q!=NULL)
{
if(*p<*q)
{
*k=*p;
k++;
p++;
}
else if(*p=*q)
{
*k=*p;
k++;
p++;
q++;
}
esle
{
*k=*q;
k++;
q++;
}
}
if(p==NULL)
k=q;
else
k=q;
}