顺序栈和链栈(C++实现）

顺序栈的实现如下

const int stackSize = 10;
template<typename T>
class Stack
{
private:
	int top;
	T data[stackSize];
public:
	Stack();
	void insertStack(T x);
	T exitStack();
	T getStack();
	bool empty();
};

template<typename T>
Stack<T>::Stack()
{
	top = -1;
}

template<typename T>
void Stack<T>::insertStack(T x)
{
	if (top + 1 == stackSize)
	{
		throw exception("插入元素时发生了上溢");
	}
	data[++top] = x;
}

template<typename T>
T Stack<T>::exitStack()
{
	if (top == -1)
	{
		throw exception("删除栈顶元素时发生了下溢");
	}
	return data[top--];
}

template<typename T>
T Stack<T>::getStack()
{
	if (top == -1)
	{
		throw exception("获取栈顶元素时发生了下溢");
	}
	return data[top];
}

template<typename T>
bool Stack<T>::empty()
{
	if (top == -1)
	{
		return true;
	}
	return false;
}

链栈的实现如下：

template<typename T>
class Node
{
public:
	T data;
	Node<T>*next;
	Node() :next(nullptr) {};
};

template<typename T>
class LinkStack
{
private:
	Node<T>*top;
public:
	LinkStack();
	~LinkStack();
	void insertStack(T x);
	T exitStack();
	T getStack();
	bool empty();
};

template<typename T>
LinkStack<T>::LinkStack()
{
	Node<T>*p = new Node<T>();
	top = p;
}

template<typename T>
void LinkStack<T>::insertStack(T x)
{
	Node<T>*p = new Node<T>();
	p->data = x;
	p->next = top;
	top = p;
}

template<typename T>
LinkStack<T>::~LinkStack()
{
	Node<T>*p = new Node<T>();
	while (top != nullptr)
	{
		p = top;
		top = top->next;
		delete p;
	}
}

template<typename T>
T LinkStack<T>::exitStack()
{
	if (top == nullptr)
	{
		throw exception("链栈为空，发生下溢");
	}
	Node<T>*p = top;
	int x = p->data;
	top = top->next;
	delete p;
	return x;
}

template<typename T>
T LinkStack<T>::getStack()
{
	if (top == nullptr)
	{
		throw exception("链栈为空，发生下溢");
	}
	return top->data;
}

template<typename T>
bool LinkStack<T>::empty()
{
	if (top == nullptr)
	{
		return true;
	}
	return false;
}