1.顺序表的基本操作:建立顺序表,修改顺序表,插入顺序表,删除顺序表
#include<iostream>
#define maxsize 100
using namespace std;
typedef int ElemType;
typedef struct
{
ElemType *elem;
int length;
}SqList;
int InitList(SqList &L)
{
L.elem=new ElemType[maxsize];
if(!L.elem)
cout<<"初始化失败"<<endl;
L.length=0;
return 1;
}
int CreatList(SqList &L){
int n;
cout<<"请输入顺序表的元素个数:";
cin>>n;
for(int i=0;i<n;i++){
cout<<"请输入第 "<<(i+1)<<" 个元素:";
cin>>L.elem[i];
L.length++;
}
}
int ListInsert(SqList &L,int i,ElemType e)
{
if((i<1)||(i>L.length+1))
cout<<"插入失败"<<endl;
if(L.length==maxsize)
cout<<"插入失败"<<endl;
for(int j=L.length-1;j>=i-1;j--)
L.elem[j+1]=L.elem[j]