C语言约瑟夫环顺序表，帮忙改错，谢谢

Question

#include
#include
typedef int DataType;
typedef PSeqList;
void josephus_seq(PSeqList palist,int s,int m)
{
int s1,i,w;
s1=s-1;
for(i=palist->n;i>0;i--)
{
s1=(s1+m-1)%i;
w=palist->element[s1];
printf("out element %d\n",w);
deleteP_seq(palist,s1);
{
int q;
if(s1palist->n-1)
{
printf("Not exist!\n");
return 0;
}
for(q=s1;qn-1;q++)
palist->n=palist->n-1;
return 1;
}
}
}
main()
{
PSeqList jos_alist;
int i;
int n,s,m;
printf("\n please input the value of n=");
scanf("%d",&n);
printf("please input the values of s=");
scanf("%d",&s);
printf("please input the values of m=");
scanf("%d",&m);
jos_alist=createNullList_seq(n);
{
jos_alist palist=(jos_alist)malloc(sizeof(struct SeqList));
if(palist!=NULL)
{
pslist->element=(DataType*)malloc(sizeof(DataType)*m);
if(palist->element)
{
palist->maxnum=m;
palist->n=0;
return palist;
}
else free(palist);
}
printf("Out of space!!\n");
return NULL;
}
if(jos_alist!=NULL)
{
for(i=0;i insertpre_seq(jos_alist,i,i+1);
{
int q;
if(palist->n>=palist->maxnun)
{
printf("Overflow!\n");
return 0;
}
if(pn)
{
printf("Not exist!\n");
return 0;
}
for(q=palist->n-1;q>=p;q--)
palist->element[q+1]=palist->element[q];
palist->element[p]=x;
palist->n=palist->n+1;
return 1;
}
josepjus_seq(jos_alist,s,m);
free(jos_alist->element);
free(jos_alist);
}
}

Answer 1

typedef PSeqList; 这个定义呢？代码不全，把struct SeqList的定义先补上

main() 这个怎么连返回值都没有，你这个是turbo c的写法

if(s1palist->n-1) 这里s1后面少运算符

错误太多了，你要是实在不会，搜索个现成的抄抄吧。