C++单链表基本操作

#include <iostream>
using namespace std;
struct NODE
{
	int data;
	NODE * next;
};
class List
{
	NODE * head;
public:
	//若构造函数里为head = NULL;则表示不带头结点的链表，只有头指针
	List() {  head = new NODE; head->next = NULL;}   //建立带头结点的链表，head->next = NULL;表示链表为空，只有一个头结点
	void CreatList1(int n);        //头插入法创建链表
	void CreatList2(int n);        //尾插入法创建链表
	void Insert(int i, int e);     //按位置插入元素：在i位置处插入元素为e的节点
	void InserList(int aData, int bData);	//按节点插入节点：在节点a之前插入节点b
	void Delete(int i);             //按位置删除：删除i处的节点
	void Deletek(int k);
	void DeleteList(int aData);	//按数据删除：删除数据为aData的几点
	int GetData(int i);            //取得i处的元素值
	int GetDatak(int k);            //取得倒数第k个的元素值
	int ChangeData(int i);    //修改i处的元素值
	int ChangeDatak(int k);		//修改倒数第k个的元素值
	int Search(int obj);           //寻找链表中有无与obj匹配的元素：第几个元素为obj
	int ListLength();              //获得表的长度
	NODE * Reverse();				//链表倒置
	void OutputList();
	NODE * Gethead() { return head->next; }    //head->next;表示指向第一个节点的指针，返回第一个节点
};
//输出链表
void List::OutputList()
{
	NODE * current = head->next;
	while (current != NULL)
	{
		cout << current->data << " ";
		current = current->next;
	}
	cout << endl;
}
//创建链表：头插法
void List::CreatList1(int n)
{
	NODE * p;
	NODE *temp;
	p = head;
	cout << "请依次输入" << n << "个链表的值:";
	for (int i = 1; i <= n; i++) {
		temp = (NODE*)new(NODE);	//或temp = new NODE;
		cin >> temp->data;
		temp->next = p->next;
		p->next = temp;
	}
}
//尾插入法创建链表
void List::CreatList2(int n)
{      
	NODE *p;
	NODE *temp;
	p = head;
	cout << "请依次输入" << n << "个链表的值:";
	for (int i = 0; i < n; i++) {
		temp = new NODE;
		cin >> temp->data;
		p->next = temp;
		p = temp;
	}
	p->next = NULL;
}
//插入：在i位置处插入元素为e的节点
void List::Insert(int i, int e) {
	NODE *temp;
	temp = head;
	int j = 0;
	while (temp&&j < i - 1) {
		temp = temp->next;
		j++;
	}
	if (!temp || j > i - 1) {
		cout << "插入位置错误";
	}
	else {
		NODE *s;
		s = new NODE;
		s->data = e;
		s->next = temp->next;
		temp->next = s;
	}
}
//插入：在节点a前面插入节点b，可以新建链表
void List::InserList(int aData, int bData)
{
	NODE * p, *q = NULL, *s;		//p指向a，q指向a前一个节点，s指向b
	s = (NODE*)new(NODE);
	s->data = bData;
	p = head->next;
	if (head->next == NULL)
	{
		head->next = s;
		s->next = NULL;
	}
	else if (p->data == aData)
	{
		s->next = p;
		head->next = s;
	}
	else
	{
		while (p->data != aData && p->next != NULL)
		{
			q = p;
			p = p->next;
		}
		if (p->data == aData)
		{
			q->next = s;
			s->next = p;
		}
		else
		{
			p->next = s;
			s->next = NULL;
		}
	}
}
//按位置删除：删除i处的节点
void List::Delete(int i){
	NODE *temp;
	temp = head;
	int j = 0;
	while (temp&&j < i - 1) {
		temp = temp->next;
		j++;
	}
	if (!temp || j > i - 1) {
		cout << "删除位置错误";
		return;
	}
	else {
		NODE *s;
		s = temp->next;
		temp->next = s->next;
		delete s;
	}
}
//删除倒数第k个节点
void List::Deletek(int k) {
	NODE *p = head->next;
	NODE *q = head->next;
	int i = 1;
	while (i<=k) {					//注意是“<=”，为了让q指向倒数第k+1个，q->next为倒数第k个
		i++;
		p = p->next;
	}
	while (p->next != NULL) {
		p = p->next;
		q = q->next;			//这时q指向倒数第k+1个，q->next为倒数第k个
	}
	NODE *s;
	s = q->next;
	q->next = s->next;
	delete s;
}
//删除节点a
void List::DeleteList(int aData)
{
	NODE * p, *q = NULL;
	p = head->next;
	if (p == NULL)
	{
		return;
	}
	if (p->data == aData)
	{
		head->next = p->next;
		delete p;
	}
	else
	{
		while (p->data != aData && p->next != NULL)
		{
			q = p;
			p = p->next;
		}
		if (p->data == aData)
		{
			q->next = p->next;
			delete p;
		}
	}

}
//取得i处的元素值
int List::GetData(int i) {
	NODE *temp;
	temp = head;
	int j = 0;
	while (temp&&j < i - 1) {
		temp = temp->next;
		j++;
	}
	if (!temp || j > i - 1) {
		cout << "寻找位置错误" <<endl;
		return -1;
	}
	else {
		cout << i << "处的数据为：" << temp->next->data << endl;
		return temp->data;
	}
}
//取得倒数第k个的元素值
int List::GetDatak(int k) {
	NODE *p = head->next;
	NODE *q = head->next;
	int i = 1;
	while (i<k) {
		i++;
		p = p->next;
	}
	while (p->next != NULL) {
		p = p->next;
		q = q->next;
	}
	cout << "倒数第" << k << "个元素为：" << q->data << "\n";
	return q->data;
}
//修改i处的元素值
int List::ChangeData(int i) {
	NODE *temp;
	temp = head;
	int j = 0;
	int x;
	cout << "输入要修改的值：";
	cin >> x;
	while (temp&&j < i - 1) {
		temp = temp->next;
		j++;
	}
	if (!temp || j > i - 1) {
		cout << "寻找位置错误" << endl;
		return -1;
	}
	else {
		temp->next->data = x;
		return temp->next->data;
	}
}
//修改倒数第k个的元素值
int List::ChangeDatak(int k) {
	NODE *p = head->next;
	NODE *q = head->next;
	int i = 1;
	int x;
	cout << "输入要修改的值：";
	cin >> x;
	while (i<k) {
		i++;
		p = p->next;
	}
	while (p->next != NULL) {
		p = p->next;
		q = q->next;
	}
	q->data = x;
	return q->data;
}
//寻找链表中有无与obj匹配的元素：第几个元素为obj
int List::Search(int obj) {
	int j = 1;
	NODE *temp;
	temp = head->next;
	while (temp && temp->data != obj) {
		temp = temp->next;
		j++;
	}
	if (temp == NULL) {
		cout << "该链表中无此元素" << endl;
		return 0;
	}
	else {
		cout << "在该链表中的第" << j << "个元素等于" << obj << endl;
		return j;
	}
}
//获得表的长度
int List::ListLength() {
	NODE *temp;
	temp = head;
	int j = 0;
	while (temp) {
		temp = temp->next;
		j++;
	}
	cout << "该链表的长度为：" << j - 1 << endl;
	return j;
}
//链表倒置
NODE * List::Reverse() {
	NODE *r;
	NODE *p = head->next;
	head->next = NULL;
	while (p!=NULL) {
		r = p->next;
		p->next = head->next;
		head->next = p;
		p = r;
	}
	return head;
}

int main()
{
	int num1;
	List list1;
	List list2;

	cout << "请输入链表1长度：" ;
	cin >> num1;
	list1.CreatList1(num1);
	cout << "头插法创建链表1：";
	list1.OutputList();
	cout << "逆转链表后为：";
	list1.Reverse();
	list1.OutputList();
	list1.Insert(3,22);
	cout << "在3位置插入22后为：";
	list1.OutputList();
	list1.InserList(22,3);
	cout << "在22之前插入3后为：";
	list1.OutputList();
	list1.Delete(1);
	cout << "删除1位置处的元素后为：";
	list1.OutputList();
	list1.Deletek(2);
	cout << "删除倒数第2个元素后为：";
	list1.OutputList();
	list1.DeleteList(22);
	cout << "删除22后为：";
	list1.OutputList();
	cout << "获取位置3处的元素为：";
	list1.GetData(3);
	cout << "获取倒数第3个的元素为：";
	list1.GetDatak(3);
	cout << "修改位置2处的元素："<<endl;
	list1.ChangeData(2);
	cout << "修改后的列表为：";
	list1.OutputList();
	cout << "修改倒数第2个元素：" << endl;
	list1.ChangeDatak(2);
	cout << "修改后的列表为：";
	list1.OutputList();
	cout << "寻找元素9：";
	list1.Search(9);
	cout << "列表1长度为：";
	list1.ListLength();
	cout << endl;
	
	int num2;
	cout << "请输入链表2长度：" ;
	cin >> num2;
	list2.CreatList2(num2);
	cout << "尾插法创建链表2：";
	list2.OutputList();
	cout << "逆转链表后为：";
	list2.Reverse();
	list2.OutputList();
	list2.Insert(3,22);
	cout << "在3位置插入22后为：";
	list2.OutputList();
	list2.InserList(22,3);
	cout << "在22之前插入3后为：";
	list2.OutputList();
	list2.Delete(1);
	cout << "删除1位置处的元素后为：";
	list2.OutputList();
	list2.Deletek(2);
	cout << "删除倒数第2个元素后为：";
	list2.OutputList();
	list2.DeleteList(22);
	cout << "删除22后为：";
	list2.OutputList();
	cout << "获取位置3处的元素为：";
	list2.GetData(3);
	cout << "获取倒数第3个的元素为：";
	list2.GetDatak(3);
	cout << "修改位置2处的元素："<<endl;
	list2.ChangeData(2);
	cout << "修改后的列表为：";
	list2.OutputList();
	cout << "修改倒数第2个元素：" << endl;
	list2.ChangeDatak(2);
	cout << "修改后的列表为：";
	list2.OutputList();
	cout << "寻找元素9：";
	list2.Search(9);
	cout << "列表1长度为：";
	list2.ListLength();
	cout << endl;
	
}