m0_58966334的博客

#include<iostream> using namespace std; //链栈实现 template<typename T> class node { public: node() { data = NULL; next = nullptr; } node(T _data) { data = _data; next = nullptr; } ~node() { if (next != nullptr) { next = nullptr; } } T data.

#include<iostream> using namespace std; //顺序栈 template<typename T> class listStack { public: listStack(int _max = 10) { max = _max; L = new T[max]; length = 0; top = &L[0]; } ~listStack() { if (L != nullptr) { delete[] L; } } void pu.