线性表-数组实现（C语言）

#include<stdio.h>
 struct List{
 int  data[100];
 int last;
};
 void initiate(List *list)// 赋初始值
 {
  list->last=-1;
 }
 void add(List *list,int  data)//添加元素
 {
  if(list->last>100)
   printf("overflow\n");
   else
   { 
   list->last++;
   list->data[list->last]=data;
   }
 }
 void Remove(List *list,int number)//移除第number个元素
 {
  int i;
  for(i=number-1;i<list->last;i++){
   list->data[i]=list->data[i+1];
  }
  list->last--;
 }
 int locate(List *list,int number )
 {
  for(int i=0;i<=list->last;i++){
   if(list->data[i]==number ){
    return i=i+1;
    break;
   }
  }
 }
 void insert(List *list,int locate,int object)
 {
  int i;
  if(list->last<locate-1)
  {
   printf("error\n");
   return ;
  }
  for(i=list->last;i>=locate-1;i--){
   list->data[i+1]=list->data[i];
  }
  list->data[i+1]=object;
  list->last++;
 }
 void print(List *list){
  for(int i=0;i<list->last+1;i++){
   printf("%d\t",list->data[i]);
  }
 }
 int main()
 {
  List list;//调试
  List *plist;
  plist=&list;
  initiate(plist);
  add(plist,1);
  add(plist,2);
  add(plist,3);
  Remove(plist,2);
  int s=locate(plist,1);
  insert(plist,2,10);
  printf("S=%d\n",s);
  printf("数组\n");
  print(plist);
 
  return 0;
 }