#include<stdio.h>
#include<stdlib.h>
#define maxsize 1024

typedef struct
{
    int data[maxsize];
    int last;
}sequenlist;

int main()
{

    sequenlist *L;   
    int number,i,j;
    scanf("%d",&number);
    while(number != 0)
    {
        for(i = 0;i < 10;i++)
        {
            (*L).data[i] = number;
            scanf("%d",&number);
        }
        for(j = 0;j<10;j++)
        {
            printf("%d",(*L).data[j]);
        }

    }

    return 0;
}

现在去整理一下，不过还是搞不定

今晚继续开夜车弄出来，要完成 建立，插入，删除，我才弄到在第二步。
#include<stdio.h>
#include<stdlib.h>
#define maxsize 1024

typedef struct
{
    int data[maxsize];
    int last;
}sequenlist;

main()
{
sequenlist *L;  
L = (sequenlist*)malloc(sizeof(sequenlist));
    int number,i,j,p,q;
    int a,b,c;
    printf("The number of num:");
 
    scanf("%d",&p);
    printf("Please input  %d number:",p);
   
    (*L).last = 0;
    for(i = 0;i <p ;i++)
    {
scanf("%d",&number);
        (*L).data[i] = number;
        (*L).last = (*L).last + 1;
    }
        
        for(j = 0;j < p;j++)
        {
            printf("%d  ",(*L).data[j]);
              
}
        
        printf("111\n");
        
 
        printf("插入第几位：");
scanf("%d",&a);
printf("459");
        getchar();
        printf("Plese input the position you want to put in:");
        if((a < 1) || (a > p))
        {
   printf("error");
}
        
        else
        {
printf("P;ease input the number.");
        scanf("%d",&c);
        printf("459");
        getchar();
        
           for(b = p;b >= p - a;b--)
           {
              (*L).data[b+1] = (*L).data[b];
           }
  (*L).data[b-1] = c;   
          }
          for(j = 0;j < p +1;j++)
        {
            printf("%d  ",(*L).data[j]);
              
}
        
        printf("111\n");
        getchar();
        getchar();
 
}