链栈--C++语言实现

1.linkStack.h文件

#pragma once  //防止头文件重复包含

#include<iostream>


//链栈是运算受阻的单链表，只能在连栈头部进行操作
//链栈的头指针就是栈顶
//不需要头结点
//不存在栈满的情况
//空栈相当于头指针指向空
//插入和删除操作仅在栈顶出执行


//结点类
template<typename DataType>
class Node
{
public:
	DataType data;
	Node* next;
};


//链栈类
template<typename DataType>
class LinkStack
{
public:
	LinkStack();
	~LinkStack();
	void push(DataType);
	DataType pop();
	int linkStackLength();
	bool linkStackEmpty();
	void getTop();
	void printLinkList();
	void clearLinkList();
private:
	int size;
	Node<DataType>* head;
};

2.linkStack.cpp

#include<iostream>
#include"linkStack.h"

using namespace std;


//初始化链栈
template<typename DataType>
LinkStack<DataType>::LinkStack()
{
	this->head = NULL;
	this->size = 0;
}

//析构函数
template<typename DataType>
LinkStack<DataType>::~LinkStack()
{
	//依次删除指针
	while (this->head)
	{
		Node<DataType>* p = this->head;
		this->head = this->head->next;
		delete p;
	}
}

//获取指针长度
template<typename DataType>
int LinkStack<DataType>::linkStackLength()
{
	return this->size;
}

//判断链栈是否为空
template<typename DataType>
bool LinkStack<DataType>::linkStackEmpty()
{
	if (this->size == 0)
	{
		return true;
	}
	return false;
}

//入栈
template<typename DataType>
void LinkStack<DataType>::push(DataType data)
{
	Node<DataType>* p = new Node<DataType>;
	p->data = data;
	p->next = this->head;
	this->head = p;
	this->size++;
}

//出栈
template<typename DataType>
DataType LinkStack<DataType>::pop()
{
	if (this->size == 0)
	{
		cout << "当前没有元素可以出栈" << endl;
		return 0;
	}
	else
	{
		Node<DataType>* p = this->head;
		DataType x;
		x = this->head->data;
		this->head = this->head->next;
		delete p;
		this->size--;
		return x;
	}
}

//取栈顶元素
template<typename DataType>
void LinkStack<DataType>::getTop()
{
	if (this->size == 0)
	{
		cout << "链栈没有元素，无法取出栈顶元素" << endl;
	}
	else
	{
		cout << "获取的链栈栈顶元素为:" << this->head->data << endl;;
	}
}


template<typename DataType>
void LinkStack<DataType>::printLinkList()
{
	if (this->size == 0)
	{
		cout << "当前链栈没有元素可以打印" << endl;
	}
	else
	{
		Node<DataType>* p;
		p = this->head;
		for (int i = 0; i < this->size; i++)
		{
			cout << p->data << " ";
			p = p->next;
		}
		cout << endl;
	}
}


//清空链表
template<typename DataType>
void LinkStack<DataType>::clearLinkList()
{
	if (this->size == 0)
	{
		cout << "栈已空，无需清空" << endl;
		return;
	}
	Node<DataType>* p = this->head;
	while (this->head)
	{
		p = p->next;
		delete this->head;
		this->head = p;
		this->size--;
	}
	cout << "链栈已经清空" << endl;
}

3.测试代码：链栈.cpp

#include<iostream>
#include"linkStack.h"
#include"linkStack.cpp"

using namespace std;

void test01()
{
	LinkStack<int> stack = LinkStack<int>();
	for (int i = 0; i < 10; i++)
	{
		stack.push(i);
	}	
	cout << "当前的链栈长度为:" << stack.linkStackLength() << endl;
	stack.printLinkList();
	for (int i = 0; i < 10; i++)
	{
		cout << "出栈元素为:" << stack.pop() << endl;
	}
	stack.getTop();
	stack.printLinkList();
	stack.clearLinkList();
}

int main()
{
	test01();
	system("pause");
	return 0;
}