#include <stdio.h>
#include <stdlib.h>// 顺序表存储空间动态分配
#define InitSize 10      // 顺序表初始长度
typedef int ElemType;   // int类型重命名为ElemType，方便后续调整typedef struct {        // 定义结构体ElemType *data;     // 用静态的数组存放数据元素ElemType MaxSize;   // 顺序表最大容量ElemType length;    // 顺序表数据长度
} SqList;
void PrintList(SqList L);// 初始化顺序表
void InitList(SqList &L) {// 用malloc函数申请一片连续的存储空间L.data = (ElemType *) malloc(InitSize * sizeof(ElemType));L.MaxSize = InitSize;L.length = 0;
}//按位插入
int InsertList(SqList &L, int i, int e) {if (i < 1 || i > L.length || L.length == L.MaxSize)return 0;for (int j = L.length; j >= i; j--) {L.data[j] = L.data[j - 1];}L.data[i - 1] = e;L.length++;return 1;
}//按位删除
int  DeleteList(SqList &L, ElemType i, ElemType &e) {if (i < 0 || i >= L.length)return 0;printf("删除顺序表第%d个位置数据：%d\n", i, L.data[i - 1]);for (int j = i - 1; j < L.length - 1; j++) {L.data[j] = L.data[j + 1];}L.length--;return 1;
}//修改第i个元素为e
int  AlterList(SqList &L, int i, int e) {if (i < 0 || i > L.length - 1)return 0;L.data[i - 1] = e;return 1;
}//按位查询
int GetList(SqList L, int i) {if (i < 0 || i > L.length) {printf("error");return 0;}return L.data[i - 1];
}//按值查询，并输出位序
int  LocatedList(SqList L, int e) {for (int i = 0; i < L.length; i++) {if (e == L.data[i])return i + 1;}return 0;
}//输出顺序表表长
int Length(SqList L) {return L.length;
}bool IsEmpty (SqList L) {if (L.length == 0)return true;return false;
}//打印数据
void PrintList(SqList L) {for (int  i = 0; i < L.length; i++) {printf("data[%d]=%d\n", i, L.data[i]);}
}void DestoryList(SqList &L ) {free(L.data);L.length = 0;L.MaxSize = 0;}//增加动态数组的长度
void IncreaseSize(SqList &L, ElemType len) {ElemType *p = L.data;L.data = (int *) malloc((L.MaxSize + len) * sizeof(ElemType));for (ElemType i = 0; i < L.length; i++) {L.data[i] = p[i];   // 将数据复制到新区域}L.MaxSize += len; // 顺序表最大长度增加lenfree(p);            // 释放原来的内存空间
}//主函数
int main() {SqList L;   // 初始化InitList(L);L.length = InitSize;for (ElemType i = 0; i < L.MaxSize; i++) {      // 数组赋值L.data[i] = i;}int e;printf("删除flag=%d\n", DeleteList(L, 5, e));PrintList(L);printf("插入flag=%d\n", InsertList(L, 2, 66));PrintList(L);printf("修改flag=%d\n", AlterList(L, 1, 88));PrintList(L);printf("按位查找%d\n", GetList(L, 5));printf("按值查找%d\n", LocatedList(L, 88));printf("顺序表的表长为%d\n", Length(L));printf("顺序表是否为空%d\n", IsEmpty(L));printf("MaxSize ==%d\n", L.MaxSize);IncreaseSize(L, 8);printf("MaxSize ==%d\n", L.MaxSize);DestoryList(L);PrintList(L);
}