#include <iostream>
using namespace std;
#define MaxSize 10
// 1. 順序表
// 靜態分配
typedef struct
{int data[MaxSize];int length; // 當前長度
} SqList;
// 靜態分配初始化順序表
void InitList(SqList &L)
{for (int i = 0; i < MaxSize; i++){L.data[i] = 0;}L.length = 0;
}
// 插入元素 到第 i 個位置
bool ListInsert(SqList &L, int i, int e)
{if (i < 1 || i > L.length + 1){return false;}if (L.length >= MaxSize){return false;}for (int j = L.length; j >= i; j--){L.data[j] = L.data[j - 1];}L.data[i - 1] = e;L.length++;return true;
}
// 刪除第 i 個位置的元素
bool ListDelete(SqList &L, int i, int &e)
{if (i < 1 || i > L.length){return false;}// 將被刪除的元素賦值給 e，便于輸出e = L.data[i - 1];for (int j = i; j < L.length; j++){L.data[j - 1] = L.data[j];}L.length--;return true;
}
// 遍歷順序表
void ListTraverse(SqList L)
{for (int i = 0; i < L.length; i++){cout << L.data[i] << " ";}cout << endl;
}
int main()
{int e;SqList L;InitList(L);ListInsert(L, 1, 1);ListInsert(L, 2, 2);ListInsert(L, 3, 3);ListDelete(L, 2, e);cout << "刪除的元素是" << e << endl;ListTraverse(L);return 0;
}