【C++】链表实现

单链表、头指针、头结点、首元节点

#include<iostream>
using namespace std;
typedef struct Node {
	int element;
	Node * next;
}*PNODE;
PNODE creat_list();
void traverse_list(PNODE pHead);

int main() {
	PNODE pHead = creat_list();
	traverse_list(pHead);
	
	return 0;
}

PNODE creat_list()
{
	int len;//用来存放有效节点的个数
	int val;//用来临时存放用户输入的节点的值
	cout << "请输入你需要生成的链表节点的个数: len = ";
	cin >> len;
	

	PNODE pHead = new Node();
	if (NULL == pHead) {
		cout << "内存分配失败，程序终止！\n";
		exit(-1);
	}
	PNODE pTail = pHead;
	for (int i = 0;i < len;i++) {
		cout << "请输入第" << i + 1 << "个节点的值：";
		cin >> val;
		PNODE pNew = new Node();
		if (NULL == pNew) {
			cout << "内存分配失败，程序终止！\n";
			exit(-1);
		}
		pNew->element = val;
		pTail->next = pNew;
		pNew->next = NULL;
		pTail = pNew;

	}
	return pHead;
}

void traverse_list(PNODE pHead)
{
	PNODE p = pHead->next;//指向头节点
	while (p != NULL) {
		cout << p->element << " ";
		p = p->next;
	}
	cout << "\n";
}

全部代码：

#include<iostream>
using namespace std;
typedef struct Node {
	int element;
	Node * next;
}*PNODE;
PNODE creat_list();
void traverse_list(PNODE pHead);
bool empty(PNODE);
int length_list(PNODE);
bool insert_list(PNODE,int,int);
bool delete_list(PNODE,int,int *);//删除节点，将节点元素返回
void sort_list(PNODE);

int main() {
	PNODE pHead = creat_list();
	traverse_list(pHead);
	if (empty(pHead)) {
		cout << "链表为空\n";
	}
	else {
		cout << "链表不为空\n";
	}
	int len = length_list(pHead);
	cout << "链表长度为:" << len << "\n";
	sort_list(pHead);
	traverse_list(pHead);
	if (insert_list(pHead, 5, 100)) {
		cout << "插入成功\n";
	}
	else {
		cout << "插入失败\n";
	}
	traverse_list(pHead);
	int temp;
	if (delete_list(pHead, 5, &temp)) {
		cout << "删除成功!\n";
		cout << "删除的元素是" << temp << "\n";
	}
	else {
		cout << "删除失败!\n";
	}
	
	traverse_list(pHead);
	return 0;
}

PNODE creat_list()
{
	int len;//用来存放有效节点的个数
	int val;//用来临时存放用户输入的节点的值
	cout << "请输入你需要生成的链表节点的个数: len = ";
	cin >> len;
	

	PNODE pHead = new Node();
	if (NULL == pHead) {
		cout << "内存分配失败，程序终止！\n";
		exit(-1);
	}
	PNODE pTail = pHead;
	for (int i = 0;i < len;i++) {
		cout << "请输入第" << i + 1 << "个节点的值：";
		cin >> val;
		PNODE pNew = new Node();
		if (NULL == pNew) {
			cout << "内存分配失败，程序终止！\n";
			exit(-1);
		}
		pNew->element = val;
		pTail->next = pNew;
		pNew->next = NULL;
		pTail = pNew;

	}
	return pHead;
}

void traverse_list(PNODE pHead)
{
	PNODE p = pHead->next;//指向头节点
	while (p != NULL) {
		cout << p->element << " ";
		p = p->next;
	}
	cout << "\n";
}
bool empty(PNODE pHead) {
	if (pHead->next == NULL) {
		return true;
	}
	return false;
}
int length_list(PNODE pHead) {
	PNODE p = pHead->next;
	int count = 0;
	while (p != NULL) {
		count++;
		p = p->next;
	}
	return count;
}

bool insert_list(PNODE pHead, int index, int element)
{	
	PNODE p = pHead;
	int len = length_list(pHead);
	if (index > len || index < 0) {
		cout << "索引错误!";
		return false;
	}
	for (int i = 0;i < index;i++) {
		p = p->next;
	}
	PNODE q = new Node();
	q->element = element;
	q->next = p->next;
	p->next = q;
	return true;
}

bool delete_list(PNODE pHead, int index, int*t)
{
	PNODE p = pHead;
	int len = length_list(pHead);
	if (index >= len || index < 0) {
		cout << "索引错误!";
		return false;
	}
	for (int i = 0;i < index;i++) {
		p = p->next;
	}
	PNODE q = p->next;
	*t = q->element;
	p->next = q->next;
	delete q;
	return true;
}
void sort_list(PNODE pHead) {
	int temp;
	for (PNODE p = pHead->next;p != NULL;p = p->next) {
		for (PNODE q = p->next;q != NULL;q = q->next) {
			if (q->element < p->element) {
				temp = q->element;
				q->element = p->element;
				p->element = temp;
			}
		}
	}
	
}