C++实现顺序栈和链栈（使用模板类）

顺序栈

类定义

//顺序栈
#pragma once

const int Maxsize = 10;

template<class T>
class Sq_Stack
{
private:
	T s[Maxsize];
	int top;

public:
	Sq_Stack();
	bool isEmpty();
	bool isFull();
	bool Push(T elem);
	bool Pop(T& elem);
	~Sq_Stack();
};

总体实现

//顺序栈
#include "Sq_Stack.h"

template<class T>
Sq_Stack<T>::Sq_Stack()
{
	top = 0;
}

template<class T>
bool Sq_Stack<T>::isEmpty()
{
	return top == 0;
}

template<class T>
bool Sq_Stack<T>::isFull()
{
	return top == Maxsize;
}

template<class T>
bool Sq_Stack<T>::Push(T elem)
{
	if (isFull())
		return false;
	else
	{
		s[top++] = elem;
		return true;
	}
}

template<class T>
bool Sq_Stack<T>::Pop(T& elem)
{
	if (isEmpty())
		return false;
	else
	{
		elem = s[--top];
		return true;
	}
}

template<class T>
Sq_Stack<T>::~Sq_Stack()
{
	top = 0;
}

分块

初始化

template<class T>
Sq_Stack<T>::Sq_Stack()
{
	top = 0;
}

判空

template<class T>
bool Sq_Stack<T>::isEmpty()
{
	return top == 0;
}

判满

template<class T>
bool Sq_Stack<T>::isFull()
{
	return top == Maxsize;
}

入栈

template<class T>
bool Sq_Stack<T>::Push(T elem)
{
	if (isFull())
		return false;
	else
	{
		s[top++] = elem;
		return true;
	}
}

出栈

template<class T>
bool Sq_Stack<T>::Pop(T& elem)
{
	if (isEmpty())
		return false;
	else
	{
		elem = s[--top];
		return true;
	}
}

销毁（逻辑销毁）

template<class T>
Sq_Stack<T>::~Sq_Stack()
{
	top = 0;
}

链栈

结点定义

template<class T>
class Node
{
public:
	T data;
	Node* next;
};

方法定义

template<class T>
class Link_Stact
{
private:
	Node<T>* top;

public:
	Link_Stact();
	bool isEmpty();
	void Push(T elem);
	bool Pop(T& elem);
};

总体实现

//链栈
#include <iostream>
#include "Link_Stack.h"

template<class T>
Link_Stact<T>::Link_Stact()
{
	top = NULL;
}

template<class T>
bool Link_Stact<T>::isEmpty()
{
	return top == NULL;
}

template<class T>
void Link_Stact<T>::Push(T elem)
{
	Node<T>* p = new Node<T>;
	p->data = elem;
	p->next = top;
	top = p;
}

template<class T>
bool Link_Stact<T>::Pop(T& elem)
{
	if (isEmpty())
		return false;
	else
	{
		elem = top->data;
		top = top->next;
		return true;
	}
}

分块

初始化

template<class T>
Link_Stact<T>::Link_Stact()
{
	top = NULL;
}

判空

template<class T>
bool Link_Stact<T>::isEmpty()
{
	return top == NULL;
}

入栈

template<class T>
void Link_Stact<T>::Push(T elem)
{
	Node<T>* p = new Node<T>;
	p->data = elem;
	p->next = top;
	top = p;
}

出栈

template<class T>
bool Link_Stact<T>::Pop(T& elem)
{
	if (isEmpty())
		return false;
	else
	{
		elem = top->data;
		top = top->next;
		return true;
	}
}

测试代码

#include <iostream>
#include "Sq_Stack.h"
#include "Sq_Stack.cpp"
#include "Link_Stack.h"
#include "Link_Stack.cpp"

using namespace std;

int main()
{
	//顺序栈测试
	Sq_Stack<int> s;
	for (int i = 0; i < 10; i++)
		s.Push(i + 1);
	int k;
	for (int i = 0; i < 10; i++)
	{
		s.Pop(k);
		cout << k << " ";
	}
	cout << endl;
	
	//链栈测试
	Link_Stact<char> ls;
	for (int i = 0; i < 10; i++)
	{
		ls.Push('a' + i);
	}
		
	char c;
	for (int i = 0; i < 10; i++)
	{
		ls.Pop(c);
		cout << c;
	}
	cout << endl;
	return 0;
}

运行结果