带头结点链表的再次创作[C++实现]

学习内容：

对带头结点链表的再次研究与实现

1. 增
2. 删
3. 改
4. 查
5. 遍历

---

代码实现：

#include<iostream>
using namespace std;

typedef struct node {
	int data;
	node* next;
}Node, * LinkList;

LinkList CreateList(int n) {
	cout << "开始创建链表！请键入" << n << "个值！" << endl;
	Node* phead, * pre, * p;
	int temp_value;
	phead = new Node;
	phead->next = NULL;
	pre = phead;
	for (int i = 0; i < n; i++) {
		cin >> temp_value;
		p = new Node;
		p->data = temp_value;
		p->next = NULL;
		pre->next = p;
		pre = p;
	}
	cout << "链表创建完毕！" << endl;
	return phead;
}

void insert(LinkList L, int pos, int x) {
	cout << "开始插入新结点！" << endl;
	cout << "在第" << pos << "个位置插入结点的值为" << x << "的结点" << endl;
	Node* temp = L;
	for (int i = 0; i < pos - 1; i++) {
		temp = temp->next;
	}
	Node* q = new Node;
	q->data = x;
	q->next = temp->next;
	temp->next = q;
	cout << "插入" << x << "完毕！" << endl;
}

void del(LinkList L, int x) {
	cout << "开始删除结点！" << endl;
	Node * pre, * p;
	int flag, count = 0;
	pre = L;
	p = pre->next;
	cout << "\n想删除全部值为" << x << "的结点，还是第一个值为" << x << "的结点？" << endl;
	cout << "\t1.删除全部值为" << x << "的结点（enter'1'）" << endl;
	cout << "\t2.删除第一个值为" << x << "的结点(enter'0')" << endl;
	cin >> flag;
	if (flag) {
		while (p) {
			if (p->data == x) {
				pre->next = p->next;
				delete p;
				p = pre->next;
				count++;
			}
			else {
				pre = p;
				p = pre->next;
			}
		}
		cout << "\t共删除" << count << "个" << "值为" << x << "的结点" << endl;
	}
	else {
		while (p) {
			if (p->data == x) {
				pre->next = p->next;
				delete p;
				p = pre->next;
				break;
			}
			else {
				pre = p;
				p = pre->next;
			}
		}
	}
	cout << "删除结点完毕！" << endl;
}

void modify(LinkList L, int pos, int x) {
	cout << "开始修改结点！" << endl;
	cout << "将第" << pos << "个结点的值修改为" << x << endl;
	Node* temp = L;
	for (int i = 0; i < pos; i++) {
		temp = temp->next;
	}
	temp->data = x;
	cout << "修改完毕！" << endl;
}

void search(LinkList L, int x) {
	cout << "开始查找值为" << x << "的结点" << endl;
	cout << "位置：";
	Node* p = L->next;
	int pos = 1, count = 0;
	while (p) {
		if (p->data == x) {
			count++;
			cout << pos << " ";
		}
		p = p->next;
		pos++;
	}
	cout << "\n共" << count << "个值为" << x << "的元素，位置分别如上，查找完毕！" << endl;
}

void display(const LinkList L) {
	cout << "当前链表结点如下：";
	Node* p = L->next;
	while (p) {
		cout << p->data << " ";
		p = p->next;
	}
	cout << "\n" << endl;
}

int main()
{
	LinkList L;
	int n;
	cout << "你想创建的链表结点个数为：";
	cin >> n;
	L = CreateList(n);
	display(L);
	insert(L, 2, 111);
	display(L);
	insert(L, 2, 111);
	display(L);
	del(L, 111);
	display(L);
	modify(L, 2, 222);
	display(L);
	search(L, 222);
	delete L;
	return 0;
}

---

总结：

废话不想多说，直接看代码吧，通俗易懂。真要说啥，还是没事多敲敲。