tsstack.h

字符串计算公式

template<class T>
class Stack
{
	private:
		int size;
		int top;
		T stackPtr[30];
	public:
		Stack();
		~Stack()  {}
		bool push(const T);
		T pop();
		bool IsEmpty()  const  {return top == -1;}
		bool IsFull()  const  {return top==size-1;}
		T GetTop();
};

template<class T>
Stack<T>::Stack()
{
	top=-1;
}

template<class T>
bool Stack<T>::push(const T pushValue)
{
	++top;
	stackPtr[top] = pushValue;
	return TRUE;	
}

template<class T>
T Stack<T>::pop()
{

	 return stackPtr[top--];
		
}

template<class T>
T Stack<T>::GetTop()
{
	//if(!IsEmpty())
	//{
		return stackPtr[top];
	//}
}