int insert Pre_seq( PSeqList palist,int p,DataType x)
{
int q;
if (palist->n >=palist -> MAXNUM)
{
printf("Overflow! \n");
return 0;
}
if (p<0 || p>palist->n)
{
printf("Not exist! \n");
return 0;
}
for(q=palist->n-1; q>p; q-- )//改成大于
palist -> element [q +1] = palist ->element [q];
palist ->element [p+1] = x;//改成p+1
palist ->n =palist ->n +1;
return 1;
}
就可以啦
内容全部来源于网络收集，如有侵权，请联系网站删除：QQ：24596024