这是我写的代码，目的是删除顺序表中的x并输出删除后的单链表。我知道里面有很多错误。又要麻烦大家了。。。。
 给我指点下下吧。。。指出错误，建议什么的，我很需要嗯


#include <stdio.h>
#define MAX 100
typedef struct node
{
    int data[MAX];
    struct node *palist;
    int length;
}seqlist,*pseqlist;

void creat(pseqlist palist,int n )
{
    printf("输入建立%d个数据的线性表!\n",n);
    for(int k = 0;k < n;k ++)
    {
        scanf("%d",&palist ->data[k]);
    }
    palist ->length = n;
}

int deleveV_seq(pseqlist palist,int x)
{
    int i,j;
    for(i =0;i <= palist -> length-1;)
        if(x == palist ->data[i])
        {
            for (j = i;j <= palist ->length - 1;)
            {
                palist ->data[j] = palist ->data[j+1];
            }
            palist ->length --; //= palist ->length - 1;
            return 1;
        }
        else
        {
            j ++;
        }
        return 0;
}

void print(pseqlist palist)
{
    int i;
    for (i = 0;i <= palist ->length-1;i ++)
    {
        printf("%d  ",palist ->data[i]);
    }
}

void main()
{
    pseqlist p;
    creat(p,10);
    print(p);

    printf("\n\n");
    deleveV_seq(p,3);
    print(p);
   
}

指针 在使用前要记得分配空间  

        if(x == palist ->data[i])
        {
            for (j = i;j <= palist ->length - 1; j++)
            {
                palist ->data[j] = palist ->data[j+1];
            }
            palist ->length --; //= palist ->length - 1;
            return 1;
        }
        else
        {
            i++;
        }

void main()
{
    pseqlist p = (pseqlist) malloc (sizeof(struct node));

嗯，我明白了。。。。谢谢乃。。。