C++实现栈的链式存储结构的进栈、出栈

阳花花_YLJ

已于 2023-06-13 08:40:40 修改

阅读量67

点赞数 1

分类专栏：数据结构文章标签： c++ 数据结构

于 2023-06-12 09:31:51 首次发布

本文链接：https://blog.csdn.net/m0_70940447/article/details/131162236

版权

数据结构专栏收录该内容

7 篇文章 0 订阅

订阅专栏

一、每一个结点的定义和链栈的定义

class StackNode
{
public:
	StackNode(int data)
	{
		this->m_Data = data;
		this->m_Next = nullptr;
	}

	int m_Data;
	StackNode* m_Next;
};

class ListStack
{
public:
	ListStack()
	{
		this->m_Top = nullptr;
		this->m_Count = 0;
	}

	void Push(int data);
	void Pop();

private:
	StackNode* m_Top;
	int m_Count;
};

二、进栈

void ListStack::Push(int data)
{
	StackNode* Node = new StackNode(data);
	if (!this->m_Top)
	{
		this->m_Top = Node;//将第一个进栈作为栈底
	}
	else
	{
		Node->m_Next = this->m_Top;
		this->m_Top = Node;
	}
	++this->m_Count;
}

三、出栈

void ListStack::Pop()
{
	if (this->m_Count == 0)
	{
		cout << "栈为空栈，删除错误" << endl;
        return;
	}

	StackNode* Temp_Node = this->m_Top;
	this->m_Top = this->m_Top->m_Next;//m_Top给完Temp_Node先移动后删除，不然m_Top会变成野指针
	cout << Temp_Node->m_Data << " ";
	delete Temp_Node;
	Temp_Node = nullptr;
	--this->m_Count;
}

四、整体展示

#include <iostream>

using namespace std;

class StackNode
{
public:
	StackNode(int data)
	{
		this->m_Data = data;
		this->m_Next = nullptr;
	}

	int m_Data;
	StackNode* m_Next;
};

class ListStack
{
public:
	ListStack()
	{
		this->m_Top = nullptr;
		this->m_Count = 0;
	}

	void Push(int data);
	void Pop();

private:
	StackNode* m_Top;
	int m_Count;
};

void ListStack::Push(int data)
{
	StackNode* Node = new StackNode(data);
	if (!this->m_Top)
	{
		this->m_Top = Node;//将第一个进栈作为栈底
	}
	else
	{
		Node->m_Next = this->m_Top;
		this->m_Top = Node;
	}
	++this->m_Count;
}

void ListStack::Pop()
{
	if (this->m_Count == 0)
	{
		cout << "栈为空栈，删除错误" << endl;
        return;
	}

	StackNode* Temp_Node = this->m_Top;
	this->m_Top = this->m_Top->m_Next;
	cout << Temp_Node->m_Data << " ";
	delete Temp_Node;
	Temp_Node = nullptr;
	--this->m_Count;
}

void Text()
{
	ListStack LS;
	LS.Push(10);
	LS.Push(9);
	LS.Push(2);
	LS.Push(1);
	LS.Push(7);
	LS.Pop();
	LS.Pop();
	LS.Pop();
	LS.Pop();
	LS.Pop();
}

int main()
{
	Text();

	system("pause");
	return 0;
}