用c++完成单链表的各种算法

#include<iostream>

using namespace std;

//单链表的储存结构
typedef struct Node
{
	int data;
	struct Node* next;
};
typedef struct Node* LinkList; //指该结构体的指针类型 便于后继操作
LinkList L;

//单链表的初始化
int InitList(LinkList& L)
{
	L = new Node;
	L->next = NULL;
	return 1;
 }

//判断链表是否为空
int IsEmpty(LinkList L)
{
	if (L->next)
		return 0;
	else
		return 1;
}

//销毁单链表
int DestroyList(LinkList& L)
{
	while (L)
	{
		LinkList p = L;
		L = L->next;
		delete p;
	}
	return 1;
}

//清空的单链表
int ClearList(LinkList& L)
{
	LinkList p;
	LinkList q;

	p = L->next;
	while (p)
	{	
		q = p->next;
		delete p;
		p = q;
	}
	L->next = NULL;
	return 1;
}

//单链表的表长
int LengthList(LinkList L)
{
	int count = 0;
	LinkList p;

	p = L->next;

	while (p)
	{
		count++;
		p = p->next;
	}
	return count;
}

//取单链表某个元素的内容
int FindList(LinkList L,int i,int& e)
{
	LinkList p;
	int j = 1;
	
	p = L->next;
	while (p&&j<i)
	{
		p = p->next;
		j++;
	}

	if (!p||j>i)
		return 0;
	e = p->data;
	return 1;
}

//按值查找
int LocateElem(LinkList L, int e)
{
	int i = 0;
	LinkList p;
	p = L->next;
	while (p)
	{
		if (p->data == e)
			return ++i;
		p = p->next;
	}

	return 0;
}

//插入新节点
int ListInsert(LinkList& L, int i, int e)
{
	LinkList p,s;
	int j = 1;
	p = L->next;	
	while (p && j < i - 1)
	{
		p = p->next;
		j++;
	}
	if (!p || j > i - 1)
		return 0;
	s = new Node;
	s->data = e;
	s->next = p->next;
	p->next = s;
	return 1;
}

//删除某一个节点
int DeleteList(LinkList& L, int i,int &e)
{
	int j = 1;
	LinkList p,s;
	p = L;
	while (p->next&&j<i)
	{
		p = p->next;
		j++;
	}
	if (!(p->next) || j > i)
		return 0;
	s = p->next;
	p->next = s->next;
	e = s->data;
	delete s;
	return 1;
}

// 建立单链表——头插法
void CreateList_Head(LinkList& L, int n)
{
	LinkList p;
	L = new Node;
	L->next = NULL;
	for (int i = n; i > 0; i--)
	{
		p = new Node;
		cin >> p->data;
		p->next = L->next;
		L->next = p;
	}


}

//建立单链表——尾插法
void CreateList_End(LinkList& L, int i)
{
	LinkList p,r;

	L = new Node;
	L->next = NULL;
	r = L;
	for (int j = 0; j < i; j++)
	{
		p = new Node;
		cin >> p->data;
		p->next = NULL;
		r->next = p;
		r = p;
	}

}

//输出单链表
void ListTraverse(LinkList L)
{
	LinkList p;
	p = L->next;
	while (p)
	{
		cout << p->data<<" ";
		p = p->next;
	}
	cout << endl;

}

int main()
{
	LinkList L;
	int e,i,j;
	i = InitList(L);
	cout << i << endl;
	cout << "建立链表（头插法，从后往前输入）" << endl;

	CreateList_Head(L, 5);  //头插法 即最后输入的值在最前方
	cout << "输入的值为：" << endl;
	ListTraverse(L);

	cout << "清空链表" << endl;
	int a = ClearList(L);
	cout << "1:清除成功 " << endl;
	cout << a<<endl;
	
	cout << "建立新的链表（尾插法，从前往后输入）" << endl;
	CreateList_End(L, 5);
	cout << "输入的值为：" << endl;
	ListTraverse(L);

	cout << "删除第二个元素" << endl;
	int b = DeleteList(L, 2, e);
	cout << "删除的元素为：" << e<< endl;
	cout << "新的链表为：" << endl;
	ListTraverse(L);

	cout << "查找第二个元素" << endl;
	FindList(L, 2, e);
	cout << e << endl;
	cout << "此时表的长度：";
	a = LengthList(L);
	cout << a<<endl;
	
	cout << "在第二个位置插入新的元素 99"<<endl;
	ListInsert(L, 2, 99);
	cout << "此时链表为："<< endl;
	ListTraverse(L);

	cout << "查找第三个元素：" << endl;
	LocateElem(L, e);
	cout << e << endl;
	return 0;
}

刚刚学会单链表的各种操作 虽然头疼麻烦 ，但是坚持的话一定能啃掉！！希望跟我一同在学习数据结构的朋友一起坚持下去，学好学扎实数据结构呀！