单链表的十二种操作

/*结点：数据元素的储存映象，包括数据域和指针域
头结点：在单链表的第一个结点之前附设一个结点，称为头结点
头指针：指向链表中第一个结点（单链表由一个头指针唯一确定）的指针（指针指的是存储地址）
首元结点：指链表中存储线性表中第一个数据元素a1的结点。为了操作方便，通常在链表的首元结点之前附设一个结点，称为头结点.
*/
#include<iostream>

using namespace std;

typedef int DataType;
#define Node ElemType
#define ERROR NULL

//构建一个节点类
class Node
{
public:
	int data;//数据
	Node *next;//指针域
};
//创建一个单链表类
class LinkList
{
public:
	LinkList();//构造函数
	~LinkList();//析构函数
	void CreateLinkList(int n);//创建一个单链表
	void TravelLinkList();//遍历
	int GetLength();//获取链表长度
	bool IsEmpty();//判断是否为空
	ElemType *Find(DataType data);//查找节点
	void InsertElemAtEnd(DataType data);//在尾部插入结点
	void InsertElemAtIndex(DataType data, int n);//在指定位置插入结点
	void InsertElemAtHead(DataType data);//在头部插入结点
	void DeleteElemAtEnd();//删除尾部结点
	void DeleteAll();//删除所有结点
	void DeleteElemAtPoint(DataType data);//删除指定结点
	void DeleteElemAtHead();//删除头部结点
private:
	ElemType *head;

};

LinkList::LinkList()
{
	head = new ElemType;
	head->data = 0;
	head->next = NULL;
}

LinkList::~LinkList()
{
	delete head;
}

void LinkList::CreateLinkList(int n)
{
	ElemType *pnew, *ptemp;
	ptemp = head;
	if (n < 0)
	{
		cout << "输入结点个数有误" << endl;
		return ;
	}
	for (int i = 0; i < n; i++)
	{
		pnew = new ElemType;
		cout << "请输入第" << i + 1 << "个值：" << endl;
		cin >> pnew->data;
		pnew->next = NULL;
		ptemp->next = pnew;
		ptemp = pnew;//将当前节点ptemp设为尾结点
	}
}

void LinkList::TravelLinkList()
{
	if (head == NULL || head->next == NULL)
	{
		cout << "该链表为空" << endl;
	}
	ElemType *p = head->next;
	while (p->next != NULL)
	{
		cout << p->data << ' ';
		p = p->next;
	}
	cout << p->data << endl;

}

int LinkList::GetLength()
{
	int count = 0;
	ElemType *p = head->next;
	while (p != NULL)
	{
		count++;
		p = p->next;
	}
	return count;
}

bool LinkList::IsEmpty()
{
	if (head->next == NULL)
		return true;
	else
		return false;
}

ElemType * LinkList::Find(DataType data)
{
	ElemType *p = head;
	if (p == NULL)
	{
		cout << "该链表为空" << endl;
		return ERROR;
	}
	else
	{
		while (p->next != NULL)
		{
			if (p->data == data)
				return p;
			p = p->next;
		}
	}
	if (p->data == data)
		return p;
	return NULL;
}

void LinkList::InsertElemAtEnd(DataType data)
{
	ElemType *newNode = new ElemType;
	newNode->next = NULL;
	newNode->data = data;
	ElemType* p = head;
	if (head == NULL)
		head = newNode;
	else
	{
		while (p->next != NULL)
		{
			p = p->next;
		}
		p->next = newNode;
	}
}

void LinkList::InsertElemAtIndex(DataType data, int n)
{
	if (n<1 || n>GetLength())
	{
		cout << "输入的值错误" << endl;
	}
	else
	{
		ElemType *ptemp = new ElemType;
		ptemp->data = data;
		ElemType *p = head;
		int i = 1;
		while (n > i)
		{
			p = p->next;
			i++;
		}
		ptemp->next = p->next;
		p->next = ptemp;
	}
}

void LinkList::InsertElemAtHead(DataType data)
{
	ElemType *newNode = new ElemType;
	newNode->data = data;
	ElemType *p = head;
	if (head == NULL)
	{
		head = newNode;
	}
	newNode->next = p->next;
	p->next = newNode;
}

void LinkList::DeleteElemAtEnd()
{
	ElemType *p = head;
	ElemType *ptemp = NULL;
	if (p->next == NULL)
		cout << "单链表为空" << endl;
	else
	{
		while (p->next != NULL)
		{
			ptemp = p;
			p = p->next;
		}
		delete p;
		p = NULL;
		ptemp->next = NULL;
	}
}

void LinkList::DeleteAll()
{
	ElemType *p = head->next;
	ElemType *ptemp = new ElemType;
	while (p->next != NULL)
	{
		ptemp = p;
		p = p->next;
		head->next = p;
		ptemp->next = NULL;
		delete ptemp;
	}
	head->next=NULL;
}

void LinkList::DeleteElemAtPoint(DataType data)
{
	ElemType *ptemp = Find(data);
	if (ptemp == head->next)
		DeleteElemAtHead();
	else
	{
		ElemType *p = head;
		while (p->next != ptemp)
		{
			p = p->next;
		}
		p->next = ptemp->next;
		delete ptemp;
		ptemp = NULL;
	}
}

void LinkList::DeleteElemAtHead()
{
	ElemType *p = head;
	if (p == NULL || p->next == NULL)
		cout << "该链表为空" << endl;
	else
	{
		ElemType *ptemp = NULL;
		p = p->next;
		ptemp = p->next;
		delete p;
		p = NULL;
		head->next = ptemp;
	}
}

int main()
{
	LinkList l;
	int i;
	cout << "1.创建单链表   2.遍历单链表   3.获取单链表的长度   4.判断单链表是否为空   5.获取节点\n";
	cout << "6.在尾部插入指定元素   7.在指定位置插入指定元素   8.在头部插入指定元素\n";
	cout << "9.在尾部删除元素   10.删除所有元素   11.删除指定元素   12.在头部删除元素   0.退出" << endl;
	do
	{
		cout << "请输入要执行的操作:" << endl;
		cin >> i;
		switch (i)
		{
		case 1:
			int n;
			cout << "请输入单链表的长度：" << endl;
			cin >> n;
			l.CreateLinkList(n);
			break;
		case 2:
			l.TravelLinkList();
			break;
		case 3:
			cout << "该链表的长度为：" << l.GetLength() << endl;
			break;
		case 4:
			if (l.IsEmpty() == 1)
				cout << "该链表为空" << endl;
			else
				cout << "该链表非空" << endl;
			break;
		case 5:
			DataType data;
			cout << "请输入要获取结点的值：" << endl;
			cin >> data;
			cout << "该结点得值为：" << l.Find(data)->data << endl;
			break;
		case 6:
			DataType endData;
			cout << "请输入要在尾部插入的值：" << endl;
			cin >> endData;
			l.InsertElemAtEnd(endData);
			break;
		case 7:
			DataType pointData;
			int index;
			cout << "请输入要插入的数据：" << endl;
			cin >> pointData;
			cout << "请输入要插入的位置：" << endl;
			cin >> index;
			l.InsertElemAtIndex(pointData, index);
			break;
		case 8:
			DataType headData;
			cout << "请输入要在头部插入的数据：" << endl;
			cin >> headData;
			l.InsertElemAtHead(headData);
			break;
		case 9:
			l.DeleteElemAtEnd();
			break;
		case 10:
			l.DeleteAll();
			break;
		case 11:
			DataType pointDeleteData;
			cout << "请输入要删除的数据" << endl;
			cin >> pointDeleteData;
			l.DeleteElemAtPoint(pointDeleteData);
			break;
		case 12:
			l.DeleteElemAtHead();
			break;
		}
	} while (i != 0);

	system("pause");
	return 0;
}