2021-01-25

顺序表顺序存储的创建、插入、删除等操作

线性表顺序存储结构下基本操作的实现（初始化、赋值、求表长、清空、销毁、取值、插入、删除、遍历等）。

初始化

强调文本 强调文本

初始化

Status InitList(SqList &L)
{//构造顺序表
L.elem =new ElemType[INITSIZE];
if(!L.elem)exit(OVERFLOW);
L.length =0;
return OK;
}

赋初值

void Assign(SqList &L)
{
int i,n;
cout<<“请输入顺序表的长度：”;
cin>>n;
cout<<“请输入各个数据元素：”;
for(i=0;i<n;i++)
{
cin>>L.elem [i];
L.length ++;
}
}

取元素

Status GetElem(SqList L,int i,ElemType &e)
{//取元素
e=L.elem [i-1];
return OK;
}
int ListLength(SqList L)
{
return (L.length );
}

插入

Status ListInsert(SqList &L,int i,ElemType e)
{
int j;
if(i<1||i>L.length +1)return ERROR;
if(L.length ==INITSIZE)return ERROR;
for(j=L.length -1;j>=i-1;j–)
L.elem [j+1]=L.elem [j];
L.elem [i-1]=e;
L.length ++;
return OK;
}

删除

Status ListDelete(SqList &L,int i)
{
int k;
if((i<1)||(i>L.length ))return ERROR;
for(k=i;k<=L.length -1;k++)
L.elem [k-1]=L.elem [k];
L.length --;
return OK;
}

遍历

void ListTraverse(SqList L)
{//遍历
int i;
cout<<“顺序表为:”<<endl;
for(i=0;i<=L.length -1;i++)
cout<<L.elem [i]<<" ";
cout<<endl;
cout<<"表长为: "<<L.length <<endl;
}

置空

void ClearList(SqList &L)
{//置空线性表
L.length =0;
cout<<“置空成功!”<<endl;
}

销毁

Status DestroyList(SqList &L)
{//销毁线性表
if(L.elem )
{
free(L.elem );
L.elem =NULL;
L.length =0;
}
else return ERROR;
return OK ;
}

完整函数代码

#include
#define OK 1
#define OVERFLOW -1
#define ERROR 0
#define INITSIZE 10
using namespace std;
typedef int Status;
typedef int ElemType;
typedef struct {
ElemType *elem;
int length;
}SqList;
Status InitList(SqList &L)
{//构造顺序表
L.elem =new ElemType[INITSIZE];
if(!L.elem)exit(OVERFLOW);
L.length =0;
return OK;
}
void Assign(SqList &L)
{
int i,n;
cout<<“请输入顺序表的长度：”;
cin>>n;
cout<<“请输入各个数据元素：”;
for(i=0;i<n;i++)
{
cin>>L.elem [i];
L.length ++;
}
}
void ListTraverse(SqList L)
{//遍历
int i;
cout<<“顺序表为:”<<endl;
for(i=0;i<=L.length -1;i++)
cout<<L.elem [i]<<" ";
cout<<endl;
cout<<"表长为: "<<L.length <<endl;
}
Status GetElem(SqList L,int i,ElemType &e)
{//取元素
e=L.elem [i-1];
return OK;
}
int ListLength(SqList L)
{
return (L.length );
}
Status ListInsert(SqList &L,int i,ElemType e)
{
int j;
if(i<1||i>L.length +1)return ERROR;
if(L.length ==INITSIZE)return ERROR;
for(j=L.length -1;j>=i-1;j–)
L.elem [j+1]=L.elem [j];
L.elem [i-1]=e;
L.length ++;
return OK;
}
Status ListDelete(SqList &L,int i)
{
int k;
if((i<1)||(i>L.length ))return ERROR;
for(k=i;k<=L.length -1;k++)
L.elem [k-1]=L.elem [k];
L.length --;
return OK;
}
void ClearList(SqList &L)
{//置空线性表
L.length =0;
cout<<“置空成功!”<<endl;
}
Status DestroyList(SqList &L)
{//销毁线性表
if(L.elem )
{
free(L.elem );
L.elem =NULL;
L.length =0;
}
else return ERROR;
return OK ;
}
int main()
{
SqList L;
int i,j,k;
ElemType e,f;
if(InitList(L))cout<<“初始化成功!”<<endl;
Assign(L);
ListTraverse(L);
cout<<“请输入所取元素的位序：”;
cin>>i;
GetElem(L,i,e);
cout<<“所取的第”<<i<<“个元素为:”<<e<<endl;
cout<<“请输入插入的位置和元素：”;
cin>>j>>f;
ListInsert(L,j,f);
ListTraverse(L);
cout<<“请输入要删除的位序：”;
cin>>k;
ListDelete(L,k);
ListTraverse(L);
ClearList(L);
ListTraverse(L);
if(DestroyList(L))
cout<<“销毁顺序表成功!”<<endl;
return 0;
}## 顺序表的操作