sqlist union(sqlist sa,sqlist sb)
{int sc[maxsize];
sa.length=length(sa);
sb.length=length(sb);
maxsize=sa.length+sb.length;
i=0;
while(i
if(sa[i]<=sb[i]) {sc[j]=sa[i];j++}
i++;
}
while(i
}
用两个For循环来解决这问题很快比如这两个数组是a,b要并到数组c
int num,count=0,i=0,j=0;
while(count<=a.length+b.length)
{
if(a[i] c[count++]=a[i++];
else c[count++]=b[j++];
}