linux编程之线性表

   #include"stdio.h"
   #define MAX  100
   typedef struct List{
      int length;
      int num[MAX];
   }List_sequence;

   //buid new List_sequence
   int List_build(List_sequence *L,int num)
          {
             int i=;
             i=num;
             L->length=;
             for(;num>=;num--)
             {
                    L->num[num]=num;
                    ++L->length;
                    printf("num=%d\n",num);
                  }
          return ;
          }
  //insert data at somewhere
  int List_insert(List_sequence *L,int num_,int data)
          {
             int j=;
             int i=num_;

             if(num_<||num_>=L->length)
                  {
                     printf("error \n");
                  }
             for(j=L->length;j>=num_;j--)
                  {
                     L->num[j+]=L->num[j];
                  }
                  L->num[num_]=data;
                  ++L->length;
             printf("position:%d\n data:%d\n length:%d \n",num_,L->num[num_],L->length);
             return ;

          }
  //delete data at somewhere
  int List_delete(List_sequence *L,int num)
          {
            if(num<||num>L->length)
              {
                  printf("num error\n");
              }
            int i=;
            i=num-;
            for(;i<L->length;i++)
              {
                  L->num[i]=L->num[i+];
              }
           --L->length;
            return ;
          }
  int List_ergodic(List_sequence *L)
          {
            int i=;
              for(i=;i<L->length;i++)
                {
                  printf("position:%d\n data:%d\n",i,L->num[i]);
                }
            return ;
          }
  int main(int argc,char **argv)
          {
             List_sequence *L;
             L=(List_sequence *)malloc(sizeof(List_sequence));
             List_build(L,);
             List_insert(L,,);
             List_ergodic(L);
             List_delete(L,);
             List_ergodic(L);
             return ;
          }