C++ 带有头结点的单链表的简单实现

最新推荐文章于 2025-06-09 20:59:28 发布

原创

最新推荐文章于 2025-06-09 20:59:28 发布 · 938 阅读

1 ·

CC 4.0 BY-SA版权

文章标签：

#c++ #null #include #delete #class

本文介绍了使用C++实现一个带有头结点的单链表类，包括构造函数初始化链表、析构函数删除所有节点、在链表前端插入节点、按值删除节点以及遍历链表的方法。示例代码展示了如何创建链表、添加元素、删除元素和打印链表。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

#include <iostream>

using namespace std;



struct Node {
	int data;
	Node * next;
};

class MyList{
private:
	Node * head;
public:
	MyList()
	{
		head = new Node;
		head->data = 0;
		head->next = NULL;
	}
	~MyList()
	{
		while (this->head != NULL)	//delete node one by one, should get the next node before delete
		{
			Node *temp = head->next;
			delete head;
			head = temp;
		}
	}
	
	void addFront(int d)//add new node right after the head node
	{
		Node * pNew = new Node;
		pNew->data = d;
		pNew->next = head ->next;
		head->next = pNew;
	}

	int remove(int d)	//should record the previous pointer before the deleted pointer
	{
		Node * pTemp = head;
		while (pTemp->next != NULL && pTemp->next->data != d)
		{
			pTemp = pTemp->next;
		}
		if (pTemp -> next ==NULL)
		{
			cout<<"temp->next is null"<<endl;
			return -1;
		}
		Node * pDel = pTemp->next;
		pTemp->next = pDel->next;