stack_mg.cpp

一个好用的迷宫子程序

#include<stdlib.h>
#include<iostream.h>
#include"Stack_Mg.h"

void stack::InitStack(Stack& S,int ms)
{
  S.stack=new Mi_Gong [ms];
  if(!S.stack)
  {
     cerr<<"Memory allocation failure!";
     exit(1);
  }
  S.top=-1;
  S.StackMaxSize=ms;
}

bool stack::StackEmpty(Stack& S)
{
  return S.top==-1;
}

void stack::Push(Stack& S,Mi_Gong& item)
{
  if(S.top==S.StackMaxSize-1)
  {
     cerr<<"Stack is full!"<<endl;
     exit(1);
  }
  S.top++;
  S.stack[S.top]=item;
}

Mi_Gong stack::Pop(Stack& S)
{
  if(S.top==-1)
  {
     cerr<<" Stack is empty!!"<<endl;
     exit(1);
  }
  S.top--;
  return S.stack[S.top+1];
}