#include<stdio.h>
typedef int ElemType;
typedef int Status;
#define MAXSIZE 5
#define OK 1
#define ERROR 0
typedef struct
{
ElemType data[MAXSIZE];
int length;
}SqList;
//顺序结构的线性表初始化
void InitSqList(SqList *L)
{
L->length=0;
}
//获取顺序结构的线性表元素值
Status GetElem(SqList *L,int i,ElemType *e)
{
if(L->length==0 || i<1 || i>L->length)
return ERROR;
*e=L->data[i-1];
return OK;
}
//往顺序结构的线性表添加元素
Status ListInsert(SqList *L,int i,ElemType e)
{
int k;
if(i<1 || i>L->length+1)
return ERROR;
if(L->length==MAXSIZE)
return ERROR;
if(i<=L->length)
{
for(k=L->length-1;k>i-1;i--)
L->data[k+1]=L->data[k];
}
L->data[i-1]=e;
L->length++;
return OK;
}
//删除顺序的线性表某个元素
Status ListDelete(SqList *L,int i,ElemType *e)
{
int k;
if(L->length==0)
return ERROR;
if(i<1 || i>L->length)
return ERROR;
*e=L->data[i-1];
for(k=i;k<L->length;k++)
L->data[k-1]=L->data[k];
L->length--;
return OK;
}
//主函数
int main()
{
SqList sq;
int i;
int value;
Status flag;
InitSqList(&sq);
for(i=1;i<=8;i++)
{
flag=ListInsert(&sq,sq.length+1,i);
printf("flag=%d length=%d\n",flag,sq.length);
}
ListDelete(&sq,2,&value);
printf("value=%d\n",value);
for(i=1;i<=8;i++)
{
flag=GetElem(&sq,i,&value);
printf("flag=%d length=%d value=%d\n",flag,sq.length,value);
}
return 0;
}
运行效果图如下: