C++实现顺序表的常用操作(插入删出查找输出)

#include<iostream>using namespace std;#define MAXSIZE 15typedef int DataType;typedef struct{DataType data[MAXSIZE]; //通常用一位数组来描述顺序表的数据存储int SeqLength; /*线性表长度*/} SeqList;SeqList *Init_SeqList(); //初始化顺序表void Define_SeqList(SeqList *L,int n); //填充顺序表的内容void Display_SeqList(SeqList *L); //提取顺序表中的元素int Insert_SeqList(SeqList *L,int i,DataType x); //添加元素到指定位置（从开始）int Delete_SeqList(SeqList *L,int i); //删除指定位置的元素（从开始）【Sequence.cpp】#include "Sequence.h"#include<iostream>using namespace std;SeqList *Init_SeqList()//顺序表的初始化算法,将顺序表清空{SeqList *L;L=new SeqList;L->SeqLength=0; /*长度置为-1*/return L;}void Define_SeqList(SeqList *L,int n)//顺序表的定义算法{cout<<"请依次输入顺序表中要储存的元素："<<endl;for(int i=0;i<n;i++){cin>>L->data[i]; //输入数组元素L->SeqLength++;}}void Display_SeqList(SeqList *L)//顺序表的输出算法{cout<<"顺序表中储存的元素为"<<endl;int i;for(i=0;i<=L->SeqLength-1;i++){cout<<L->data[i]<<" ";}cout<<endl;}int Insert_SeqList(SeqList *L,int i,DataType x) //顺序表的插入算法{cout<<"把元素"<<x<<"插入到位置"<<i<<"上"<<endl;int j;if(L->SeqLength==MAXSIZE-1) //数组长度等于设定值-1，则表满{cout<<"表满"<<endl;return -1;}if(i<1||i>L->SeqLength+1) //插入位置在第一个之前，或者插入到大于当前数组的长度+1{cout<<"位置错"<<endl;return 0;}for(j=L->SeqLength-1;j>=i;j--) //i之后全部后移{L->data[j+1]=L->data[j];}L->data[i]=x; //将元素填充到空白位置L->SeqLength++;cout<<"插入成功"<<endl;Display_SeqList(L);return 1;}int Delete_SeqList(SeqList *L,int i)//顺序表的删除算法{cout<<"将位置为"<<i<<"的元素删除"<<endl;int j;if(i<1||i>L->SeqLength){cout<<"不存在第"<<i<<"个元素"<<endl;return 0;}for(j=i;j<=L->SeqLength-1;j++){L->data[j]=L->data[j+1]; //i索引之后全部前移}L->SeqLength--;cout<<"删除成功"<<endl;Display_SeqList(L);return 1;}

#include "Sequence.h"#include<iostream>using namespace std;int main(){SeqList *L;//顺序表的定义L=Init_SeqList();//顺序表的初始化Define_SeqList(L,6);//定义顺序表Display_SeqList(L);//顺序表的输出Insert_SeqList(L,4,3);//顺序表的插入Insert_SeqList(L,6,21);Insert_SeqList(L,2,15);Delete_SeqList(L,5);//顺序表的删除Delete_SeqList(L,3);Delete_SeqList(L,12);return 0;}