stksequence.cpp

自己写的堆栈算法

#include "StkSequence.h"


template <class Type> Stack<Type>::Stack(int s):top(-1),MaxSize(s){
	elements = new Type[MaxSize];
	assert(elements != 0);
}

template <class Type> void Stack<Type>::Push(const Type &item){
	assert(!IsFull());
	elements[++top] = item;
}

template <class Type> Type Stack<Type>::Pop(){
	assert(!IsEmpty());
	return elements[top--];
}

template <class Type> Type Stack<Type>::GetTop(){
	assert(!IsEmpty());
	return elements[top];
}