单向链表的实现及应用Visual Studio2017 C++

一、单向链表类模板(LinkList.h)

#pragma once
#include<iostream>
using namespace std;
template<class T>
class LinkNode
{
	template<class T>
	friend class LinkList;//将链式表类声明为友类
public:
	LinkNode()//构造函数
	{
		next = NULL;
	}
private:
	T data;//结点元素
	LinkNode<T> * next;//指向下一个结点的指针
};

template<class T>
class LinkList
{
public:
	LinkList()//构造函数
	{
		head = new LinkNode<T>();//创建头结点
	}
	~LinkList()//析构函数
	{
		T x;
		int len = GetLength();
		for (int i = len; i >= 1; i--)
			DeleteByIndex(i, x);//释放所有结点
		delete head;//释放头结点
	}
	LinkList<T>&Insert(int k, const T&x)
	{
		LinkNode<T>*p = head;//p指向头结点
		LinkNode<T>*newNode = new LinkNode<T>;//创建待插入的新结点
		newNode->data = x;
		int len = GetLength();
		if (k<1 || k>len + 1)
		{
			cout << "元素下标越界，添加元素失败";
		}
		else
		{
			for (int i = 1; i < k; i++)
			{
				p = p->next;//将p指针移动到第k-1个结点
			}
			newNode->next = p->next;//将新结点newNode插入到链表中
			p->next = newNode;
		}
		return *this;
	}

	bool IsEmpty()const
	{
		return head->next == NULL;
	}

	int GetLength()const
	{
		int length = 0;
		LinkNode<T>*p = head->next;
		while (p)
		{
			length++;
			p = p->next;
		}
		return length;
	}

	bool GetData(int k, T&x)
	{
		LinkNode<T>*p = head->next;
		int index = 1;
		if (k<1 || k>GetLength())
			return false;
		while (p != NULL && index < k)
		{
			index++;
			p->next;
		}
		if (p == NULL)
			return false;
		else
		{
			x = p->data;
			return true;
		}
	}

	bool ModifyData(int k, const T&x)
	{
		LinkNode<T>*p = head->next;
		int index = 1;
		if (k<1 || k>GetLength())
			return false;
		while (p != NULL && index < k)
		{
			index++;
			p->next;
		}
		if (p == NULL)
			return false;
		else
		{
			p->data = x;
			return true;
		}
	}

	int Find(const T&x)
	{
		LinkNode<T>*p = head->next;
		int index = 1;
		while (p != NULL && p->data != x)
		{
			p = p->next;
			index++;
		}
		if (p != NULL)
			return index;
		else
			return 0;
	}

	LinkList<T>&DeleteByIndex(int k, T&x)
	{
		if (GetData(k, x))
		{
			LinkNode<T>*p = head;//p指向头结点
			LinkNode<T>*q = NULL;//q指向空地址
			for (int i = 1; i < k; i++)
			{
				p = p->next;//将p指针移动到第k-1个结点
			}
			q = p->next;//q指向待删除的第k个结点
			p->next = q->next;//将第k个结点从链表中逻辑删除
			delete q;//物理删除该结点
		}
		else
			cout << "元素下标越界,删除失败\n";
		return *this;
	}

	LinkList<T>&DeleteByKey(const T&x, T&y)
	{
		int index = Find(x);//得到要删除元素的位置
		if (index != 0)
			return DeleteByIndex(index, y);
		else
		{
			cout << "没有此元素， 删除失败\n";
			return *this;
		}
	}

	void OutPut(ostream&out)
	{
		LinkNode<T>*p = head->next;
		while (p != NULL)
		{
			out << p->data << endl;
			p = p->next;
		}
	}
private:
	LinkNode<T>*head;//指向链表的第一个头结点的指针
};

//重载插入运算符<<
template<class T>
ostream&operator<<(ostream& out, LinkList<T>& x)
{
	x.OutPut(out);
	return out;
}

 

二、简单数据元素和复杂数据元素单向链表的应用(test01.cpp)

#include<iostream>
#include<string>
using namespace std;
#include"LinkList.h"

class Node
{
public:
	Node(string NumberOfStudent, string NameOfStudent, int grade[])
	{
		StdNumber = NumberOfStudent;
		StdName = NameOfStudent;
		for (int i = 0; i < 3; i++)
		{
			Score[i] = grade[i];
		}
	}
	Node()//无参构造函数
	{

	}
	Node& GetNode()//得到结点数据
	{
		return *this;
	}
	void OutPutNode(ostream& out) const//输出结点数据
	{
		out << StdNumber << " " << StdName << endl;
		out << "语文：" << Score[0] << " ";
		out << "数学：" << Score[1] << " ";
		out << "英语：" << Score[2] << " ";
	}

private:
	string StdNumber;
	string StdName;
	int Score[3];
};

ostream& operator<<(ostream& out, const Node& x)
{
	x.OutPutNode(out);
	return out;
}


int main()
{
	LinkList<int>IntegerLList;
	int x, y;
	
	IntegerLList.Insert(1, 100);
	IntegerLList.Insert(2, 200);
	IntegerLList.Insert(3, 300);
	IntegerLList.Insert(4, 400);

	cout << "当前表的长度为：" << IntegerLList.GetLength() << endl;
	cout << "当前表的元素为：\n" << IntegerLList << endl;
	//读取并输出表中第3个元素的值，判断元素100在表中的位置
	if (IntegerLList.GetData(3, x))
		cout << "表中第3个元素为：" << x << endl;
	x = 100;
	cout << "元素100在表中的位置为：" << IntegerLList.Find(x) << endl;
	//将100修改为150，删除200和400后，显示当前表的相关信息
	x = 150;
	IntegerLList.ModifyData(1, x);
	IntegerLList.DeleteByIndex(2, x);
	cout << x << endl; 
	x = 400;
	IntegerLList.DeleteByKey(x, y);
	cout << "当前表的长度为：" << IntegerLList.GetLength() << endl;
	cout << "当前表的元素为：\n" << IntegerLList << endl;

	LinkList<Node>NodeLList;//最多有10个以Node对象为数据元素的顺序表
	int grade1[3] = { 99,100,95 };
	int grade2[3] = { 95,98,88 };
	int grade3[3] = { 90,90,90 };
	Node Node1("10001", "张三", grade1);
	Node Node2("10002", "李四", grade2);
	Node Node3("10003", "王五", grade3);
	Node z;

	//将两个结点插入表中
	NodeLList.Insert(1, Node1);
	NodeLList.Insert(2, Node2);
	//显示当前表的状态
	cout << "当前表的长度为：" << NodeLList.GetLength() << endl;
	cout << "当前表的元素为：\n" << NodeLList << endl;
	//将表中第2个元素输出
	NodeLList.GetData(2, z);
	cout << "表中的第2个元素为：\n" << z << endl;
	//删除和修改元素信息，显示当前表的状态
	NodeLList.DeleteByIndex(2, z);
	cout << "刚刚删除的元素为：\n" << z << endl;
	NodeLList.ModifyData(1, Node3);
	cout << "当前表的长度为：" << NodeLList.GetLength() << endl;
	cout << "当前表的元素为：\n" << NodeLList << endl;


	system("pause");
	return 0;
}

 

 

 三、循环链表和单向链表的几个操作代码的对比

两种链表结构的主要的不同是，在循环链表的结构中，空表的条件是

head->next==head;

而在单向链表结构中，空表的条件是

head->next==NULL;