C++实现链式栈

#pragma once
template<typename T>
struct SNode {
	T data;
	SNode* Next;
};

template<typename T>
using List = SNode<T>*;

template<typename T>
using Top = SNode<T>*;

template<typename T>
class Stack
{
public:
	Stack();
	~Stack();
	void push(const T& X);
	const T& pop();

private:
	List<T> first;//表头结点
	Top<T> top;//栈顶
};

//创建一个空栈，只有一个表头
template<typename T>
Stack<T>::Stack() :first{ new SNode<T> }
{
	first->Next = nullptr;
}

//释放所有结点
template<typename T>
Stack<T>::~Stack()
{
	Top<T> temp;
	while (first->Next != nullptr)
	{
		temp = top;
		first->Next = top->Next;
		top = top->Next;
		delete temp;
	}
	delete first;
}

//入栈操作
template<typename T>
void Stack<T>::push(const T& X)
{
	top = new SNode<T>;
	top->Next = first->Next;
	first->Next = top;
	top->data = X;
}

//出栈操作
template<typename T>
const T& Stack<T>::pop()
{
	Top<T> temp;
	if (first->Next != nullptr) {
		temp = top;
		first->Next = top->Next;
		T data = top->data;
		top = top->Next;
		delete temp;
		return data;
	}
}

#include<iostream>
#include"链式栈.h"

using std::cout;

int main()
{
	Stack<int> S{};
	for (int i = 0; i < 10; ++i) {
		S.push(i);
	}
	for (int i = 0; i < 10; ++i) {
		cout << S.pop() << ' ';
	}
	return 0;
}