#include<stdio.h>
#include<malloc.h>
#include<stdlib.h>
#define LIST_INIT_SIZE 100
#define LISTNCREMENT 10
typedef struct
{
    int *elem;
    int length;
    int listsize;
}Sqlist;
Sqlist InitSList();
void InsertSList(Sqlist L,int i,int e);
void DeleteSList(Sqlist L,int i);
int Findlist(Sqlist L,int i);
void NiZhiList(Sqlist L);







include"h1.h"
int main()
{
    int i,m,e;
    Sqlist L;
    L=InitSList();
    printf("输入表长:\n");
    scanf("%d",&L.length);
    printf("");
    for(i=0;i<L.length;i++)
        scanf("%d",&L.elem[i]);
    printf("请选择你所需要的操作:\n");
    printf("1:插入元素");
    printf("2:删除元素");
    printf("3:查找元素");
    printf("4:逆转元素");
    scanf("%d",&m);
    switch(m)
    {
    case 1:
        printf("请输入需要插入的元素位置i:\n");
             scanf("%d",&i);
        printf("请输入新元素e:\n");
            scanf("%d",&e);
            InsertSList(L,i,e);
        printf("新的顺序表:\n");
           for(i=0;i<L.length+1;i++)
            printf("%d",L.elem[i]);
        break;

    case 2:
        printf("请输入需要删除的元素位置i:\n");
             scanf("%d",&i);
           DeleteSList(L,i);
        printf("新的顺序表:\n");
       for(i=0;i<L.length-1;i++)
            printf("%d",L.elem[i]);
       break;


    case 3:
        printf("请输入查找需要的元素位置i:\n");
             scanf("%d",&i);
          Findlist(L,i);
          break;
   
    case 4:
         NiZhiList(L);
         break;

    default:
        printf("error");

    }


}
/**************************************/
StSqlist InitSList()
{
    Sqlist L;
   L.elem=(int*)malloc(LIST_INIT_SIZE*sizeof(int));
   if(!L.elem)
       exit(0);
   L.length=0;
   Lilistsize=LIST_INIT_SIZE;
   return L;

}   
/******************************************/
void InsertSList(Sqlist L,int i,int e)
{
    int *newbase;
    int *q,*p;
    if((i<1)||(i>L.length))
        printf("error");
    if(L.length>=L.listsize)
    {
        newbase=(int*)realloc(L.elem,(L.listsize+LISTNCREMENT)*sizeof(int));
        if(!newbase)exit(0);
        L.elem=newbase;
        L.listsize+=LISTNCREMENT;
    }
    q=&(L.elem[i-1]);
    for(p=&(L.elem[L.length-1]);p>=q;--p)
        *(p+1)=*p;
    *q=e;
    ++L.length;
}






/************************************/
void DeleteSList(Sqlist L,int i)
{
    int *p,q,e;
    if((i<1)||(i>L.length))
        printf("error");
    p=&(L.elem[i-1]);
    e=*p;
    q=L.elem+L.length-1;
    for(++p;p<=q;++p)
        *(p-1)=*p;
    --L.length;
   

}



/*************************************/
void Findlist(Sqlist L,int i)
{
    int *p,e;
    printf("请输入查找元素的位置:\n");
    scanf("%d",&i);
    p=&(L.elem[i-1]);
    e=*p;
    printf("输出该元素:\n");
    printf("%d\n",e);
}



/*************************************/
void NIZhiList(Sqlist L)
{
    int *s,i;
    for(i=0;i<L.length/2;i++)
    {
        s=L.elem[i];
        L.elem[i]=L.elem[L.length-i-1];
        L.elem[L.length-i-1]=s;

    }
    printf("新顺序表的元素:\n");

   for(i=0;i<L.length;i++)
            printf("%d",L.elem[i]);
}