C++实现单链表基本操作
本博客按照上篇博客线性表单链表的基本操作而写出的完整代码,详情请看单链表基础概念
#include<iostream>
using namespace std;
#define OK 1
#define ERROR 0
typedef int Status;
typedef char ElemType;
typedef struct LNode{
ElemType data;
struct LNode *next;
}LNode,*LinkList;
LinkList L;
LNode *p,*q,*s,*r;
int j;
Status InitList(LinkList &L);
Status DestroyList(LinkList &L);
Status ClearList(LinkList &L);
int ListEmpty(LinkList L);
int ListLength(LinkList L);
Status GetElem(LinkList L,int i,ElemType &e);
Status LocateElem(LinkList L, ElemType &e);
Status ListInsert(LinkList &L,int i,ElemType e);
Status ListDelete(LinkList &L,int i,ElemType &e);
void CreateList_H(LinkList &L,int n);
void CreateList_R(LinkList &L,int n);
int main(){
int ret=InitList(L);
if(ret)
cout << "建立单链表成功" << endl;
else
cout << "建立单链表失败" << endl;
int i;
cout << "请输入数据个数为:";
cin >> i;
cout << "请输入" << i << "个数据元素:" << endl;
CreateList_R(L,i);
cout << "单链表的长度为:" << ListLength(L) << endl;
ElemType e;
cout << "请输入要取出数据的序号为:";
cin >> i;
GetElem(L,i,e);
cout << "取出第"<< i << "个的数据为:" << e << endl;
cout << "请输入查找的元素:";
cin >> e;
LocateElem(L, e);
cout << "元素" << e << "的序号为:" << j << endl;
cout << "请输入要插入的元素和位置:";
cin >> e >> i;
ret= ListInsert(L,i,e);
if(ret)
cout << "插入成功" << endl;
else
cout << "插入失败" << endl;
cout << "插入后的单链表长度为:" << ListLength(L) << endl;
cout << "请输入要删除的元素的序号:";
cin >> i ;
ret= ListDelete(L,i,e);
if(ret)
cout << "删除成功" << endl;
else
cout << "删除失败" << endl;
cout << "清空线性表" << endl;
ClearList(L);
ListEmpty(L);
if(ListEmpty(L))
cout << "线性表为空" << endl;
else
cout << "线性表非空" << endl;
DestroyList(L);
cout << "线性表已销毁" << endl;
return 0;
}
Status InitList(LinkList &L){
L=new LNode;
L->next=NULL;
return OK;
}
Status DestroyList(LinkList &L){
while(L){
p = L;
L=L->next;
delete p;
}
}
Status ClearList(LinkList &L){
p=L->next;
while(p){
q=p->next;
delete p;
p=q;
}
L->next=NULL;
return OK;
}
int ListEmpty(LinkList L){
if(L->next)
return 0;
else
return 1;
}
int ListLength(LinkList L){
p=L->next;
int i=0;
while(p){
i++;
p=p->next;
}
return i;
}
Status GetElem(LinkList L,int i,ElemType &e){
p=L->next;j=1;
while(p&&j<i){
p=p->next;
++j;
}
if(!p||j>i)
return ERROR;
else{
e = p->data;
return OK;
}
}
Status LocateElem(LinkList L, ElemType &e){
p=L->next;
j=1;
while(p && p->data!=e){
p=p->next;
j++;
}
if(p)
return j;
else
return 0;
}
Status ListInsert(LinkList &L,int i,ElemType e){
p=L;j=0;
while(p && j < i-1){
p=p->next;
++j;
}
if(!p||j>i-1)
return ERROR;
s = new LNode;
s->data = e;
s->next = p->next;
p->next = s;
return OK;
}
Status ListDelete(LinkList &L,int i,ElemType &e){
p=L;j=0;
while(p->next && j < i-1){
p=p->next;
++j;
}
if(!(p->next)||j>i-1)
return ERROR;
q=p->next;
p->next=q->next;
e=q->data;
delete q;
return OK;
}
void CreateList_H(LinkList &L,int n){
L = new LNode;
L->next=NULL;
for(int i=n;i>0;--i){
p=new LNode;
cin >> p->data;
p->next = L->next;
L->next = p;
}
}
void CreateList_R(LinkList &L,int n){
L=new LNode; L->next=NULL;
r = L;
for(int i=0;i<n;++i){
p=new LNode; cin >> p->data;
p->next=NULL;
r->next=p;
r=p;
}
}