shun2.c

实现数据结构中顺序表的建立插入删除查找功能。

#define n0 100
typedef struct node
  {
   int r[n0+1];
   int n;
  }qulist;
void insert(qulist *l,int x,int i)
  {
   int j;
   if(l->n==n0)
     {
      printf("full!\n");
      return;
     }
   if (i<1||i>l->n+1)
     {
      printf("possion error!\n");
      return;
     }
   for(j=l->n;j>=i;j--)
     l->r[j+1]=l->r[j];
   l->r[i]=x;
   l->n++;
  }
void delete(qulist *l,int i)
  {
   int j;
   if (l->n==0)
     {
      printf("empty list nothing to deltet!\n");
      return;
      }
   if (i<1||i>l->n)
     {printf("error!\n");
     return;
     }
   for (j=i;j<l->n;j++)
     l->r[j]=l->r[j+1];
   (l->n)--;
   return;
  }
qulist *creat()
  {
   int i,j;
   qulist *l;
   l=malloc(sizeof(qulist));
   for(i=1;i<=n0;i++)
     {
      l->n=0;
      printf("enter element %d:",i);
      scanf("%d",&j);
      l->r[i]=j;
      l->n=i;
      if (l->r[i]==0)
        {
         l->n=(l->n)-1;
         printf("entering finished\n");
         break;
        }

     }
   return l;
  }
void printlist(qulist *l)
  {
   int i;
   printf("entered list elements are: ");
   for(i=1;i<=l->n;i++)
     printf("%d ",l->r[i]);
     printf("listlong=%d\n",l->n);
   return;
  }
void locate(qulist *l,int i)
  {
   if(i>0&&i<=l->n)
     printf("the elemetn in Position %d you want is: %d",i,l->r[i]);
     else printf("error!");
   return;
  }
main()
  {
   int x,i,d,lo;
   qulist *l;
   l=creat();
   printlist(l);
   getch();
   printf("please enter the element to insert: ");
   scanf("%d",&x);
   printf("enter the position: ");
   scanf("%d",&i);
   insert(l,x,i);
   printlist(l);
   getch();
   printf("enter the position to delete: ");
   scanf("%d",&d);
   delete (l,d);
   printlist(l);
   getch();
   printf("please enter the position you want to locate:");
   scanf("%d",&lo);
   locate(l,lo);
   getch();
   free(l);

  }