顺序表的一些基础编程C++
#include iostreamusing namespace std;const int MAXSIZE100;typedef int ElemType;class Seqlist {private:ElemType data[MAXSIZE];int length;public://初始化线性表void initlist(Seqlist* L) {L-length 0;cout 初始化成功 endl;}//尾部插入数据void appendElem(Seqlist* L, ElemType e) {if (L-length MAXSIZE) {cout 已满 endl;}L-data[L-length] e;L-length;}//遍历顺序表void listElem(Seqlist* L) {for (int i 0; i L-length; i) {cout L-data[i] ;}}//指定后方插入void insertElem(Seqlist* L, int pos, ElemType e) {if (pos L-length) {for (int i L-length; i pos; i--) {L-data[i] L-data[i - 1];}L-data[pos] e;L-length;}}//删除指定元素void deleteElem(Seqlist* L, int pos) {ElemType e L-data[pos-1];if (pos L-length) {for (int i pos; i L-length; i) {L-data[i - 1] L-data[i];}}cout 删除数据为 e endl;L-length--;}};int main() {Seqlist list;list.initlist(list);list.appendElem(list, 10);list.appendElem(list, 50);list.appendElem(list, 25);list.appendElem(list, 54);list.appendElem(list, 17);list.appendElem(list, 52);list.listElem(list);cout endl;list.insertElem(list, 2, 67);list.listElem(list);cout endl;list.deleteElem(list, 5);list.listElem(list);cout endl;return 0;}
