一个顺序栈:
#include <iostream>
using namespace std;
class SeqStack
{
public:
void init(int size = 10) //初始化栈
{
_pstack = new int[size];
_top = -1;
_size = size;
}
void release() //释放栈
{
delete []_pstack;
_pstack = nullptr;
}
void push(int val)
{
if (full())
{
resize();
}
_pstack[++_top] = val;
}
void pop()
{