204LinkList

C++实现链表基本操作

最新推荐文章于 2023-03-19 16:17:15 发布

weixin_34168880

最新推荐文章于 2023-03-19 16:17:15 发布

阅读量105

点赞数

CC 4.0 BY-SA版权

原文链接：https://my.oschina.net/kuailechengxuyuan/blog/673206

2019独角兽企业重金招聘Python工程师标准>>>

注意：要严格按照后缀名新建文件。

如果按.h创建文件，后来简单重命名为.cpp文件，编译会出错。

顺序表的实现包含6个文件：

c1.h 是预处理指令；

elemtype.h 定义Elemtype数据类型；

c2-2.h 是LinkList的数据结构；

bo2-2.cpp 是SqList的基本操作函数（basic operations 缩写为 bo）；

function.h 定义bo2-2.cpp中，链表遍历函数ListTraverse所需要的访问函数；

main.cpp 是实现、测试函数。

//c1.h
#include<iostream>
#include<process.h>
#include<malloc.h>

#define OK 1
#define ERROR 0
#define INFEASIBLE -1

typedef int Status;

//elemtype.h
typedef int ElemType;

//c2-2.h
#ifndef C2_2_H
#define C2_2_H

#include"elemtype.h"
struct LNode
{
	ElemType data;
	LNode *next;
};

typedef LNode* LinkList;

void InitList(LinkList &L);
void ListTraverse(LinkList L, void(*vi)(ElemType));
Status ListInsert(LinkList &L, int index, ElemType e);
Status ListDelete(LinkList &L, int index, ElemType &e);
bool ListEmpty(LinkList L);
int ListLength(LinkList L);
Status GetElem(LinkList L, int index, ElemType &e);
int LocateElem(LinkList L, ElemType e);
Status PriorElem(LinkList L, ElemType cur_e, ElemType &pre_e);
Status NextElem(LinkList L, ElemType cur_e, ElemType &next_e);
void ClearList(LinkList &L);
void DestroyList(LinkList &L);

#endif

//bo2-2.cpp
#include"c1.h"
#include"c2-2.h"
using namespace std;

void InitList(LinkList &L)
{
	L = (LinkList)malloc(sizeof(LNode));
	if (!L)
		exit(OVERFLOW);
	L->next = nullptr;
}

void ListTraverse(LinkList L, void(*vi)(ElemType))
{
	int i = 0;
	if (L)
	{
		LinkList p = L->next;
		while (p)
		{
			vi(p->data);
			p = p->next;
			i++;
			if (!(i % 10))
				cout << endl;
		}
	}
}

Status ListInsert(LinkList &L, int index, ElemType e)
{
	int j = 0;
	LinkList p = L, s;

	while (p && j < index - 1)
	{
		p = p->next;
		j++;
	}

	if (!p || j > index - 1)
		return ERROR;

	if (!(s = (LinkList)malloc(sizeof(LNode))))
		exit(OVERFLOW);
	s->data = e;
	s->next = p->next;
	p->next = s;
	return OK;
}

Status ListDelete(LinkList &L, int index, ElemType &e)
{
	int j = 0;
	LinkList p = L, q;
	
	while (p->next && j < index - 1)
	{
		p = p->next;
		j++;
	}

	if (!p->next || j > index - 1 )
		return ERROR;

	q = p->next;
	p->next = q->next;
	e = q->data;
	free(q);
	q = nullptr;
	return OK;
}

bool ListEmpty(LinkList L)
{
	if (L->next)
		return false;
	else
		return true;
}

int ListLength(LinkList L)
{
	int i = 0;
	if (L)
	{
		LinkList p = L;
		while (p->next)
		{
			p = p->next;
			i++;
		}
		return i;
	}
	return i;
}

Status GetElem(LinkList L, int index, ElemType &e)
{
	if (index <= 0)
		return ERROR;
	int j = 0;
	LinkList p = L;
	while (p && j < index)
	{
		p = p->next;
		j++;
	}

	if (!p)
		return ERROR;
	e = p->data;
	return OK;
}

int LocateElem(LinkList L, ElemType e)
{
	int i = 0;
	if (L)
	{
		LinkList p = L;
		while (p->next)
		{
			i++;
			p = p->next;
			if (p->data == e)
				return i;
		}
	}	
	return i;
}

/*
//this function is not efficient
Status PriorElem(LinkList L, ElemType cur_e, ElemType &pre_e)
{
	int location = LocateElem(L, cur_e);
	if (location > 1)
	{
		GetElem(L, location - 1, pre_e);
		return OK;
	}
	else
		return ERROR;
}

Status NextElem(LinkList L, ElemType cur_e, ElemType &next_e)
{
	int location = LocateElem(L, cur_e);
	if (location >= 1 && location < ListLength(L))
	{
		GetElem(L, location + 1, next_e);
	return OK;
	}
	else
	return ERROR;
}
*/
Status PriorElem(LinkList L, ElemType cur_e, ElemType &pre_e)
{
	if (L)
	{
		LinkList p = L, q = L->next;
		if (!q)
			return ERROR;
		while (q->next)
		{
			p = p->next;
			q = q->next;
			if (q->data == cur_e)
			{
				pre_e = p->data;
				return OK;
			}
		}
		return ERROR;
	}
	return ERROR;
}

Status NextElem(LinkList L, ElemType cur_e, ElemType &next_e)
{
	if (L)
	{
		LinkList p = L;
		if (p->next == nullptr)
			return ERROR;
		while (p->next->next)
		{
			p = p->next;
			if (p->data == cur_e)
			{
				next_e = p->next->data;
				return OK;
			}
		}
	}
	return ERROR;
}

void ClearList(LinkList &L)
{
	if (L)
	{
		LinkList p, q;
		p = L->next;
		while (p)
		{
			q = p->next;
			free(p);
			p = q;
		}
		L->next = nullptr;
	}
}

void DestroyList(LinkList &L)
{
	LinkList q;
	while (L)
	{
		q = L->next;
		free(L);
		L = q;
	}
}

//function.h
#ifndef FUNCTION_CPP
#define FUNCTION_CPP

#include"c1.h"
#include"elemtype.h"
using namespace std;

void print(ElemType e)
{
	cout << e << " ";
}

#endif

//main.cpp
#include "c1.h"
#include "c2-2.h"
#include "function.h"
using namespace std;

int main()
{
	LinkList L;
	InitList(L);
	cout << "ListEmpty: " << ListEmpty(L) << endl;
	cout << "ListLength: " << ListLength(L) << endl;
	
	for (int i = 0; i < 100; i++)
		cout << ListInsert(L, i + 1, i);
	cout << endl;
	ListTraverse(L, print);
	cout << "ListEmpty: " << ListEmpty(L) << endl;
	cout << "ListLength: " << ListLength(L) << endl;
	cout << endl;

	ElemType e;
	ListDelete(L, 1, e);
	ListDelete(L, 97, e);
	ListTraverse(L, print);
	cout << endl;

	cout << "ListLength: " << ListLength(L) << endl;

	cout << "GetElem: " << GetElem(L, 98, e);
	cout << " e = " << e << endl;

	cout << "LocateElem: " << LocateElem(L, 99) << endl;

	cout << "PriorElem: " << PriorElem(L, 99, e);
	cout << "  e = " << e << endl;

	cout << "NextElem: " << NextElem(L, 98, e);
	cout << "  e = " << e << endl;

	ClearList(L);
	DestroyList(L);

	cin.get();
	return 0;
}

转载于:https://my.oschina.net/kuailechengxuyuan/blog/673206