线性表的结构特点:(1)存在惟一的一个被称做“第一个”的数据元素;(2)存在惟一的一个被称做“最后一个”的数据元素;(3)除第一个元素以外,集合中的每一个数据元素均只有一个前驱;(4)出最后一个元素之外,集合中的每一个元素均只有一个后继。
线性表的顺序表示和实现(结构特点:随机存取)
头文件(变量最好定义在主函数里)
#ifndef _SQliST_H_//防止重复编译
#define _SQliST_H_
#define _SQliST_H_
#include<stdlib.h>
#include<iostream>
using namespace std;
#include<iostream>
using namespace std;
#define TRUE 1
#define FALSE 0
#define OK 1
#define ERROR 0
#define INFEASIBLE -1
#define OVERFLOW -2
#define LIST_INIT_SIZE 100//线性表存储空间的初始化分配量
#define LISTINCREMENT 10//线性表存储空间的分配增量
typedef int Status;
typedef int ElemType;
ElemType i,e,cur_e,pre_e,next_e;
ElemType *p,*q,*newbase;
#define FALSE 0
#define OK 1
#define ERROR 0
#define INFEASIBLE -1
#define OVERFLOW -2
#define LIST_INIT_SIZE 100//线性表存储空间的初始化分配量
#define LISTINCREMENT 10//线性表存储空间的分配增量
typedef int Status;
typedef int ElemType;
ElemType i,e,cur_e,pre_e,next_e;
ElemType *p,*q,*newbase;
typedef struct
{
ElemType *elem;//存储空间基址
int length;//当前长度
int listsize;//当前分配的存储容量
}SqList;
SqList L;
extern Status InitList(SqList &L);
extern Status DestroyList (SqList &L);
extern Status ClearList(SqList &L);
extern Status ListEmpty(SqList L);
extern Status getElem(SqList L,ElemType i,ElemType &e);
extern Status putElem(SqList &L,ElemType i,ElemType e);
extern Status LocateElem(SqList L,ElemType i,ElemType e);
extern Status PriorElem(SqList L,ElemType cur_e,ElemType &pre_e);
extern Status NextElem(SqList L,ElemType cur_e,ElemType &next_e);
extern Status ListInsert(SqList &L,ElemType i,ElemType e);
extern Status ListDelete(SqList &L,ElemType i,ElemType &e);
extern void ListTraverse(SqList L);
{
ElemType *elem;//存储空间基址
int length;//当前长度
int listsize;//当前分配的存储容量
}SqList;
SqList L;
extern Status InitList(SqList &L);
extern Status DestroyList (SqList &L);
extern Status ClearList(SqList &L);
extern Status ListEmpty(SqList L);
extern Status getElem(SqList L,ElemType i,ElemType &e);
extern Status putElem(SqList &L,ElemType i,ElemType e);
extern Status LocateElem(SqList L,ElemType i,ElemType e);
extern Status PriorElem(SqList L,ElemType cur_e,ElemType &pre_e);
extern Status NextElem(SqList L,ElemType cur_e,ElemType &next_e);
extern Status ListInsert(SqList &L,ElemType i,ElemType e);
extern Status ListDelete(SqList &L,ElemType i,ElemType &e);
extern void ListTraverse(SqList L);
#endif
功能cpp
#include"sqlist.h"
#include<iostream>
using namespace std;
//构造线性表
Status InitList(SqList &L)
{
L.elem=(ElemType*)malloc(LIST_INIT_SIZE*sizeof(ElemType));//申请内存空间
if(!L.elem)//存储分配失败
return OVERFLOW;
L.length=0;//空表长度为0
L.listsize=LIST_INIT_SIZE;//初始化存储容量
return OK;
}
//销毁线性表
Status DestroyList (SqList &L)
{
free(L.elem);//释放内存
L.elem=NULL;
return OK;
}
//清空线性表
Status ClearList(SqList &L)
{
L.length=0;
return OK;
}
//空线性表
Status ListEmpty(SqList L)
{
if(L.length==0)
return TRUE;
else
return FALSE;
}
//获取元素
Status getElem(SqList L,ElemType i,ElemType &e)
{
if(i<1||i>L.length)//i输入不合法
return ERROR;
else
e=L.elem[i-1];
return OK;
}
//置换元素
Status putElem(SqList &L,ElemType i,ElemType e)
{
if(i<1||i>L.length)//i输入不合法
{
return ERROR;
}
else
{
L.elem[i-1]=e;
return OK;
}
}
//查找
Status LocateElem(SqList L,ElemType e)
{
p=L.elem;
int i=1;
while(*p!=e&&i<=L.length)//当不相等且i<L.length时继续查找
{
p++;
i++;
}
if(i<=L.length)
return i;
else
return 0;
}
//前驱
Status PriorElem(SqList L,ElemType cur_e,ElemType &pre_e)
{
LocateElem(L,cur_e);//调用查找函数定位
if(LocateElem(L,cur_e)!=0&&LocateElem(L,cur_e)!=1)
{
pre_e=L.elem[LocateElem(L,cur_e)-2];
return OK;
}
else
return ERROR;
}
//后继
Status NextElem(SqList L,ElemType cur_e,ElemType &next_e)
{
LocateElem(L,cur_e);//调用查找函数定位
if(LocateElem(L,cur_e)!=0&&LocateElem(L,cur_e)!=L.length)
{
next_e=L.elem[LocateElem(L,cur_e)];
return OK;
}
else
return ERROR;
}
//插入
Status ListInsert(SqList &L,ElemType i,ElemType e)
{
if(i<1||i>L.length+1)//i的值不合法
return ERROR;
if(L.length>=L.listsize)//当前存储空间已满,增加分配
{
newbase=(ElemType *)realloc(L.elem,(L.length+LISTINCREMENT)*sizeof(ElemType));
if(!newbase)//存储分配失败
{
exit(OVERFLOW) ;
}
L.elem=newbase;//新基址
L.listsize+=LISTINCREMENT;//增加存储容量
}
q=&(L.elem[i-1]);//q为插入位置
for(p=&(L.elem[L.length-1]); p>=q; p--)
{
*(p+1)=*p;
}//插入元素以及之后的元素后移
*q = e;//插入e
L.length++;//表长加1
return OK;
}
//删除
Status ListDelete(SqList &L,ElemType i,ElemType &e)
{
if(i<1||i>L.length)//i的值输入不合法
{
return ERROR;
}
p=&(L.elem[i-1]);//p为被删除元素的位置
e=*p;//被删除的元素的值赋给e
q=L.elem+L.length-1;//表尾元素的位置
for(++p;p<=q;p++)
{
*(p-1)=*p;
}//被删元素之后得元素左移
L.length--;
return OK;
}
//遍历
void ListTraverse(SqList L)
{
int i;
for(i=1;i<=L.length;i++)
{
cout<<L.elem[i-1]<<" ";
}
cout<<endl;
}
#include<iostream>
using namespace std;
//构造线性表
Status InitList(SqList &L)
{
L.elem=(ElemType*)malloc(LIST_INIT_SIZE*sizeof(ElemType));//申请内存空间
if(!L.elem)//存储分配失败
return OVERFLOW;
L.length=0;//空表长度为0
L.listsize=LIST_INIT_SIZE;//初始化存储容量
return OK;
}
//销毁线性表
Status DestroyList (SqList &L)
{
free(L.elem);//释放内存
L.elem=NULL;
return OK;
}
//清空线性表
Status ClearList(SqList &L)
{
L.length=0;
return OK;
}
//空线性表
Status ListEmpty(SqList L)
{
if(L.length==0)
return TRUE;
else
return FALSE;
}
//获取元素
Status getElem(SqList L,ElemType i,ElemType &e)
{
if(i<1||i>L.length)//i输入不合法
return ERROR;
else
e=L.elem[i-1];
return OK;
}
//置换元素
Status putElem(SqList &L,ElemType i,ElemType e)
{
if(i<1||i>L.length)//i输入不合法
{
return ERROR;
}
else
{
L.elem[i-1]=e;
return OK;
}
}
//查找
Status LocateElem(SqList L,ElemType e)
{
p=L.elem;
int i=1;
while(*p!=e&&i<=L.length)//当不相等且i<L.length时继续查找
{
p++;
i++;
}
if(i<=L.length)
return i;
else
return 0;
}
//前驱
Status PriorElem(SqList L,ElemType cur_e,ElemType &pre_e)
{
LocateElem(L,cur_e);//调用查找函数定位
if(LocateElem(L,cur_e)!=0&&LocateElem(L,cur_e)!=1)
{
pre_e=L.elem[LocateElem(L,cur_e)-2];
return OK;
}
else
return ERROR;
}
//后继
Status NextElem(SqList L,ElemType cur_e,ElemType &next_e)
{
LocateElem(L,cur_e);//调用查找函数定位
if(LocateElem(L,cur_e)!=0&&LocateElem(L,cur_e)!=L.length)
{
next_e=L.elem[LocateElem(L,cur_e)];
return OK;
}
else
return ERROR;
}
//插入
Status ListInsert(SqList &L,ElemType i,ElemType e)
{
if(i<1||i>L.length+1)//i的值不合法
return ERROR;
if(L.length>=L.listsize)//当前存储空间已满,增加分配
{
newbase=(ElemType *)realloc(L.elem,(L.length+LISTINCREMENT)*sizeof(ElemType));
if(!newbase)//存储分配失败
{
exit(OVERFLOW) ;
}
L.elem=newbase;//新基址
L.listsize+=LISTINCREMENT;//增加存储容量
}
q=&(L.elem[i-1]);//q为插入位置
for(p=&(L.elem[L.length-1]); p>=q; p--)
{
*(p+1)=*p;
}//插入元素以及之后的元素后移
*q = e;//插入e
L.length++;//表长加1
return OK;
}
//删除
Status ListDelete(SqList &L,ElemType i,ElemType &e)
{
if(i<1||i>L.length)//i的值输入不合法
{
return ERROR;
}
p=&(L.elem[i-1]);//p为被删除元素的位置
e=*p;//被删除的元素的值赋给e
q=L.elem+L.length-1;//表尾元素的位置
for(++p;p<=q;p++)
{
*(p-1)=*p;
}//被删元素之后得元素左移
L.length--;
return OK;
}
//遍历
void ListTraverse(SqList L)
{
int i;
for(i=1;i<=L.length;i++)
{
cout<<L.elem[i-1]<<" ";
}
cout<<endl;
}
主函数
#include<iostream>
#include"sqlist.h"
using namespace std;
void main()
{
int i,length;
int select;
InitList(L);
if (InitList(L)==OVERFLOW)
{
printf("分配失败,退出程序!");
}
else
{
cout<<"请输入线性表长度length:\n";
cin>>length;
for(i=1;i<=length;i++)//向线性表插入元素
{
//cin>>e;
cin>>L.elem[i-1];
//ListInsert(L,i,e);
//L.elem[i-1]=e;
}
L.length=length;
ListTraverse(L);
do
{
cout<<"1:遍历线性表中的元素"<<endl;
cout<<"2:取出线性表中的第i个元素"<<endl;
cout<<"3:置换线性表中的第i个元素"<<endl;
cout<<"4:查找输入的元素在线性表中的位置"<<endl;
cout<<"5:查找某个元素的前驱"<<endl;
cout<<"6:查找某个元素的后继"<<endl;
cout<<"7:向线性表中插入某个元素"<<endl;
cout<<"8:删除线性表中的某个元素"<<endl;
cout<<"0:结束!"<<endl;
cout<<"请选择!"<<endl;
cin>>select;
switch(select)
{
case 1:
ListTraverse(L);
break;
case 2:
cout<<"\ni=";
cin>>i;
if(getElem(L,i,e)== ERROR)
{
cout<<"i的值输入不合法"<<endl;
}
else
{
cout<<"第"<<i<<"个元素的值为:"<<e<<endl;
}
break;
case 3:
cout<<"\ni=";
cin>>i;
cout<<"\nx=";
cin>>e;
if(putElem(L,i,e)==ERROR)
{
cout<<"i的值输入不合法"<<endl;
}
else
{
cout<<"置换第i个元素后线性表为:"<<endl;
ListTraverse(L);
}
break;
case 4:
cout<<"\nx=";
cin>>e;
if(LocateElem(L,e)==0)
{
cout<<"输入的元素不在线性表中"<<endl;
}
else
{
cout<<e<<"位置为:"<<LocateElem(L,e)<<endl;
}
break;
case 5:
cout<<"\nx=";
cin>>cur_e;
if(PriorElem(L,cur_e,pre_e)==ERROR)
{
cout<<cur_e<<":没有前驱或不在线性表中"<<endl;
}
else
{
cout<<cur_e<<"前驱为:"<<pre_e<<endl;
}
break;
case 6:
cout<<"\nx=";
cin>>cur_e;
if(NextElem(L,cur_e,next_e)==ERROR)
{
cout<<cur_e<<":没有后继或不在线性表中"<<endl;
}
else
{
cout<<cur_e<<"后继为:"<<next_e<<endl;
}
break;
case 7:
cout<<"\ni=";
cin>>i;
cout<<"\nx=";
cin>>e;
if(ListInsert(L,i,e)==ERROR)
{
cout<<"i的值输入不合法"<<endl;
}
else
{
cout<<"插入i之后线性表中元素为:"<<endl;
ListTraverse(L);
}
break;
case 8:
cout<<"\ni=";
cin>>i;
cout<<"\nx=";
cin>>e;
if(ListDelete(L,i,e)==ERROR)
{
cout<<"i的值输入不合法或元素不在线性表中"<<endl;
}
else
{
cout<<"删除元素i之后线性表中元素为:"<<endl;
ListTraverse(L);
}
break;
case 0:
cout<<"操作结束!"<<endl;
break;
default:
cout<<"输入选择错误!"<<endl;
}
}while(select!=0);
DestroyList (L);
}
}//end of main
#include"sqlist.h"
using namespace std;
void main()
{
int i,length;
int select;
InitList(L);
if (InitList(L)==OVERFLOW)
{
printf("分配失败,退出程序!");
}
else
{
cout<<"请输入线性表长度length:\n";
cin>>length;
for(i=1;i<=length;i++)//向线性表插入元素
{
//cin>>e;
cin>>L.elem[i-1];
//ListInsert(L,i,e);
//L.elem[i-1]=e;
}
L.length=length;
ListTraverse(L);
do
{
cout<<"1:遍历线性表中的元素"<<endl;
cout<<"2:取出线性表中的第i个元素"<<endl;
cout<<"3:置换线性表中的第i个元素"<<endl;
cout<<"4:查找输入的元素在线性表中的位置"<<endl;
cout<<"5:查找某个元素的前驱"<<endl;
cout<<"6:查找某个元素的后继"<<endl;
cout<<"7:向线性表中插入某个元素"<<endl;
cout<<"8:删除线性表中的某个元素"<<endl;
cout<<"0:结束!"<<endl;
cout<<"请选择!"<<endl;
cin>>select;
switch(select)
{
case 1:
ListTraverse(L);
break;
case 2:
cout<<"\ni=";
cin>>i;
if(getElem(L,i,e)== ERROR)
{
cout<<"i的值输入不合法"<<endl;
}
else
{
cout<<"第"<<i<<"个元素的值为:"<<e<<endl;
}
break;
case 3:
cout<<"\ni=";
cin>>i;
cout<<"\nx=";
cin>>e;
if(putElem(L,i,e)==ERROR)
{
cout<<"i的值输入不合法"<<endl;
}
else
{
cout<<"置换第i个元素后线性表为:"<<endl;
ListTraverse(L);
}
break;
case 4:
cout<<"\nx=";
cin>>e;
if(LocateElem(L,e)==0)
{
cout<<"输入的元素不在线性表中"<<endl;
}
else
{
cout<<e<<"位置为:"<<LocateElem(L,e)<<endl;
}
break;
case 5:
cout<<"\nx=";
cin>>cur_e;
if(PriorElem(L,cur_e,pre_e)==ERROR)
{
cout<<cur_e<<":没有前驱或不在线性表中"<<endl;
}
else
{
cout<<cur_e<<"前驱为:"<<pre_e<<endl;
}
break;
case 6:
cout<<"\nx=";
cin>>cur_e;
if(NextElem(L,cur_e,next_e)==ERROR)
{
cout<<cur_e<<":没有后继或不在线性表中"<<endl;
}
else
{
cout<<cur_e<<"后继为:"<<next_e<<endl;
}
break;
case 7:
cout<<"\ni=";
cin>>i;
cout<<"\nx=";
cin>>e;
if(ListInsert(L,i,e)==ERROR)
{
cout<<"i的值输入不合法"<<endl;
}
else
{
cout<<"插入i之后线性表中元素为:"<<endl;
ListTraverse(L);
}
break;
case 8:
cout<<"\ni=";
cin>>i;
cout<<"\nx=";
cin>>e;
if(ListDelete(L,i,e)==ERROR)
{
cout<<"i的值输入不合法或元素不在线性表中"<<endl;
}
else
{
cout<<"删除元素i之后线性表中元素为:"<<endl;
ListTraverse(L);
}
break;
case 0:
cout<<"操作结束!"<<endl;
break;
default:
cout<<"输入选择错误!"<<endl;
}
}while(select!=0);
DestroyList (L);
}
}//end of main