stack.cpp

实现走迷宫的功能

#include"stdafx.h"

template<class T>
struct SStack 
{
	struct Link
	{
		T data;
		Link* next;
		void initialize(T dat,Link* nxt)
		{
			data = dat;
			next = nxt;
		}
	}* head;
	SStack()
	{
		head = 0;
	}
	void initialize()
	{
		head = 0;
	}
	void push(T dat)
	{
		Link* newLink = new Link;
		newLink->initialize(dat,head);
		head = newLink;
	}
	T* peek()
	{
		if(head == 0) return false;
		else
			return head->data;
	}

	int size()
	{
		int count = 0;
		Link* cur = head;
		while(cur!=NULL)
		{
			count++;
			cur = cur->next;
		}
		return count;
	}
	T pop()
	{
		if(head == 0) return 0;
		T result = head->data;
		Link* oldHead = head;
		head = head->next;
		delete oldHead;
		return result;
	}

	T top()
	{
	    return head->data;
	}
	bool empty()
	{
		if (head==NULL)
			return true;
		else return false;
	}
	void cleanup()
	{
		head = 0;
	}
};