stack.h

使用堆栈完成火车车厢重排的算法

/*==========================================================
**********************自定义的堆栈类************************
==========================================================*/

#ifndef _STACK_H_
#define _STACK_H_

#include <deque>
#include <list>
#include <vector>
#include <exception>
using namespace std;

template<typename T>
class stack
{
protected:
	//std::deque<T> c;  //存放元素的容器
	//std::list<T> c;
	std::vector<T> c;
public:
	class ReadEmptyStack:public std::exception
	{
	public:
		virtual const char * what() const throw()
		{
			return "read empty stack";
		}
	};
	typename std::deque<T>::size_type size() const
	{
		return c.size();
	}
	bool empty() const
	{
		return c.empty(); 
	}

	void push(const T& elem)
	{
		c.push_back(elem);
	}

	T pop()
	{
		if(c.empty())
		{
			throw ReadEmptyStack();
		}
		T elem(c.back());
		c.pop_back();
		return elem;
	}

	T& top()
	{
		if(c.empty())
		{
			throw ReadEmptyStack();
		}
		return c.back();
	}
};
#endif