已知顺序表la和lb中的元素依值非递减有序排列

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

int mergelist( const char *lap, const char *lbp, char *lc)
{

int i,j; //identify current position of la and lb

if(lap == NULL || lbp == NULL)
return -1;

for(i=0, j=0; lap[i] !=0 && lbp[j]!=0;)
{
if(lap[i] <= lbp[j])
{
*lc++ = lap[i];
++i;
}
else
{
*lc++ = lbp[j];
++j;
}
}

//process the remain part
while(lap[i]) *lc++ = lap[i++];
while(lbp[j]) *lc++ = lbp[j++];

return 0;
}

int main()
{
char *la = "abcdefg";
char *lb = "abcdefgsdfasfsdfsa";
char *lc;
size_t len;
len = strlen(la) + strlen(lb) + 1;
lc = (char *)malloc(len +1);
if(lc == NULL)
return -1;
memset(lc, 0, len+1);
if(mergelist(la, lb, lc))
{
printf("