c语言实现顺序表的基本操作

@H_696_10@#include <stdio.h>@H_696_10@#include <stdlib.h>@H_696_10@#include <malloc.h>@H_696_10@#define List_INIT_SIZE 100@H_696_10@#define liSINCREMENT 10@H_696_10@#define Elemtype int@H_696_10@#define Status int@H_696_10@typedef struct Sq{@H_696_10@ ElemType *elem;@H_696_10@ int length;@H_696_10@ int Listsize;@H_696_10@}SqList;@H_696_10@Status InitList(SqList *L)@H_696_10@{@H_696_10@ L->elem=(ElemType*)malloc(List_INIT_SIZE*sizeof(ElemTypE));@H_696_10@ if(!L->elem)@H_696_10@  return 0;@H_696_10@ L->length=0;@H_696_10@ L->Listsize=List_INIT_SIZE;@H_696_10@ return 1;@H_696_10@}@H_696_10@Status LisTinsert(SqList *L,int i,ElemType E)@H_696_10@{@H_696_10@ int *q,*p;@H_696_10@ if(i<1||i>L->length)@H_696_10@  return 0;@H_696_10@ if(L->length>L->ListsizE)@H_696_10@ { @H_696_10@        ElemType *newbase=(ElemType*)realloc(L->elem,(List_INIT_SIZE+liSINCREMENT)*sizeof(ElemTypE));@H_696_10@     if(!newbasE)@H_696_10@      return 0;@H_696_10@     L->elem=newbase;@H_696_10@     L->Listsize+=(liSINCREMENT);@H_696_10@ } @H_696_10@@H_696_10@ q=&(L->elem[i-1]);@H_696_10@ for(p=&(L->elem[L->length-1]);p>=q;--p)@H_696_10@  *(p+1)=*p;@H_696_10@    *q=e;@H_696_10@ ++L->length;@H_696_10@ return 1;@H_696_10@}@H_696_10@Status Listdelete(SqList *L,ElemType E)@H_696_10@{@H_696_10@ int *p,*q;@H_696_10@ if(i<1||i>L->length)@H_696_10@        return 0;@H_696_10@    p=&(L->elem[i-1]);@H_696_10@ e=*p;@H_696_10@ q=L->elem+L->length-1;@H_696_10@ for(++p;p<=q;++p)@H_696_10@  *(p-1)=*p;@H_696_10@ --L->length;@H_696_10@ return 1;@H_696_10@}@H_696_10@int main(voID)@H_696_10@{@H_696_10@ int i,j,e,lo,temp;@H_696_10@ SqList *L=(SqList*)malloc(sizeof(SqList));@H_696_10@    InitList(L);@H_696_10@ printf("请输顺序表的长度:\n");@H_696_10@    scanf("%d",&L->length);@H_696_10@ printf("请输入顺序表的各个元素:\n");@H_696_10@ for(i=0;i<L->length;++i)@H_696_10@  scanf("%d",&L->elem[i]);@H_696_10@ printf("输入的顺序表是:\n");@H_696_10@    for (i=0;i<L->length;++i)@H_696_10@    {@H_696_10@  printf("%d ",L->elem[i]);@H_696_10@ }@H_696_10@ printf("\n");@H_696_10@    printf("请输入插入的位置以及节点:\n");@H_696_10@    scanf("%d%d",&j,&E);@H_696_10@ LisTinsert(L,E); @H_696_10@ printf("插入后的顺序表为:\n");@H_696_10@ for (i=0;i<L->length;++i)@H_696_10@    {@H_696_10@  printf("%d ",L->elem[i]);@H_696_10@ }@H_696_10@ printf("\n");@H_696_10@ printf("请输入要删除的位置：");@H_696_10@ scanf("%d",&lo);@H_696_10@ Listdelete(L,temp);@H_696_10@ for (i=0;i<L->length;++i)@H_696_10@    {@H_696_10@  printf("%d ",L->elem[i]);@H_696_10@ }@H_696_10@ printf("\n");@H_696_10@ free(L);@H_696_10@ return 0;@H_696_10@}@H_696_10@