#include <iostream>//线性表、顺序表List#define MAX_SIZE 20
#define OK 1
#define ERROR 0
#define TRUE 1
#define FALSE 0typedef int Status;//返回状态类型
typedef int ElemType;//元素类型//结构体
typedef struct 
{ElemType data[MAX_SIZE];//数据类型，数组int length;//长度
} myList;//初始化
Status InitList(myList* list)
{//如果为空返回if (list == NULL)return ERROR;//不为空，设置为空list->length = 0;return OK;
}//清空列表
Status ClearList(myList* list)
{//如果为空返回if (list == NULL)return ERROR;//不为空，设置为空list->length = 0;return OK;
}//列表是否为空
Status ListIsEmpty(myList* list)
{//列表不存在，就是空if (list == NULL)return TRUE;//长度为0，为空if (list->length == 0)return TRUE;//否则就非空return FALSE;
}//获取列表长度
Status ListLength(myList* list)
{return list->length;
}//插入数据
Status ListInsert(myList* list,int index,const ElemType e)
{//如果列表为空if ((list->length == 0)&&(index == 1)){list->data[0] = e;list->length++;return OK;}//如果列表不为空if ((index <= list->length) && (index >= 1) && (list->length < MAX_SIZE)){for (int i = list->length - 1; i >= index - 1; i--){list->data[i + 1] = list->data[i];}list->data[index - 1] = e;list->length++;return OK;}return ERROR;
}//删除数据
Status ListDelete(myList* list, int index)
{//删除中间的元素if ((index < list->length) && (index > 0) ){for (int i = index; i < list->length; i++){list->data[i-1] = list->data[i];}list->length--;return OK;}//删除末尾的元素if ((index == list->length) && (index > 0)){list->length--;return OK;}return ERROR;
}//遍历元素
Status ListTraverse(myList* list)
{for (int i = 0; i < list->length; i++){printf("%d-->",list->data[i]);}printf("\r\n");return OK;
}//访问元素
Status GetElem(myList* list, int index, ElemType* e)
{if ((index > 0) && (index < list->length) && (list->length > 0)){*e = list->data[index - 1];return OK;}return ERROR;
}int main()
{myList list;ElemType e;Status res;int i, j;res = InitList(&list);printf("初始化后：length = %d\n", list.length);//插入元素for (i = 0; i < 6; i++){res = ListInsert(&list, 1, i);}ListTraverse(&list);//显示元素res = ListIsEmpty(&list);printf("list 是否为空？%d(1： 是，0： 否)\n", res);ClearList(&list);res = ListIsEmpty(&list);printf("list 是否为空？%d(1： 是，0： 否)\n", res);for (i = 0; i < 11; i++){res = ListInsert(&list, 1, i);}ListTraverse(&list);//显示元素ListInsert(&list, 1, 0);ListTraverse(&list);//显示元素GetElem(&list, 5, &e);printf("第5元素是%d\n", e);j = list.length;res =  ListDelete(&list, j+1);if (res == ERROR)printf("删除第%d元素失败！\n", j + 1);elseprintf("删除第%d元素成功！\n", j);res = ListDelete(&list, j);if (res == ERROR)printf("删除第%d元素失败！\n", j);elseprintf("删除第%d元素成功！\n", j);ListTraverse(&list);//显示元素res = ListDelete(&list, 5);if(res == OK)printf("删除第%d元素成功！\n", 5);ListTraverse(&list);//显示元素return 0;
}