顺序栈

#include<iostream>
#include<list>
#include<assert.h>
using namespace std;
template<typename T>
class SqStack
{
private:
T *base,*top;
int stacksize;
public:
SqStack(int k=1)
{
base = new T[k];
assert(base!=NULL);
top = base;
stacksize = k;
}
~SqStack()
{
delete []base;
}
bool push(T e)
{
T *newbase;
if(top-base == stacksize)
{
newbase = new T[stacksize*2];
if(newbase == NULL)
{
return false;
}
for(int j=0;j<top-base;j++)
{
*(newbase+j) = *(base+j);
}
delete[]base;
top = base+stacksize;
stacksize *=2;
}
*top++ = e;
return true;
}
bool Pop(T &e)
{
if(top == base)
{
return false;
}
e = *--top;
return true;
}
bool empty()
{
return top == base;
}
int length()const
{
return top-base;
}
void Clear()
{
top = base;
}
};
typedef int T;
int main()
{
SqStack<T> sq(3);
sq.push(1);
sq.push(2);
return 0;
}