用类来模拟（栈）操作
#include <cstdio> #include <iostream> #include <cmath> #include <cstring> using namespace std; template<typename T> class Stack { public: Stack(int size =10) { MAX_SIZE =10; tp =new T[size]; this->size =0; } ~Stack() { delete tp; } void push(T dat) { if(size == MAX_SIZE) { printf("Stack is overflow~\n"); } tp[size++] =dat; } T pop() { if(size ==0) { printf("Stack is empty~\n"); } T temp =tp[--size]; return temp; } private: int MAX_SIZE; int size; T* tp; }; int main() { Stack<int> stack(20); for(int i=1; i<20; i++) { stack.push(i); } printf("pop.....\n"); for(int i =1; i<20; i++) { printf("%d\n",stack.pop()); } return 0; }