栈和队列(码).docVIP

栈和队列 1.顺序栈 sqstack.h #include iostream using namespace std; const int MAXSIZE=50; struct Elem{ int data; }; typedef int ElemType; struct SqStack{ ElemType base[MAXSIZE]; int top; }; void initStack(SqStack s); void clearStack(SqStack s); bool isEmpty(SqStack s); bool isFull(SqStack s); ElemType peek(SqStack s); void push(SqStack s,const ElemType e); ElemType pop(SqStack s); sqstack.cpp #include sqstack.h void initStack(SqStack s){ s.top=0; } void clearStack(SqStack s){ s.top=0; } bool isEmpty(SqStack s){ return s.top==0; } bool isFull(SqStack s){ return s.top==MAXSIZE; } ElemType peek(SqStack s){ if(s.top==0){ cerrStack is empty!endl; exit(1); } return s.base[s.top-1]; } void push(SqStack s,const ElemType e){ if(s.top==MAXSIZE){ cerrStack overflow!endl; exit(1); } s.base[s.top]=e; ++s.top; } ElemType pop(SqStack s){ if(s.top==0){ cerrStack is empty!endl; exit(1); } --s.top; ElemType temp=s.base[s.top]; return temp; } main.cpp #include sqstack.h void conversion(int n,int r){ SqStack s; initStack(s); while(n){ push(s,n%r); n=n/r; } while(!isEmpty(s)) coutpop(s); coutendl; } bool bracketsCheck(char* c){ SqStack s; initStack(s); for(int i=0;c[i]!=\0;++i){ switch(c[i]){ case [: case (: push(s,c[i]); break; case ]: if(peek(s)==[) pop(s); else return false; break; case ): if(peek(s)==() pop(s); else return false; break; } } if(isEmpty(s)) return true; else return false; } int main(){ SqStack a; ElemType b=s,c=g; initStack(a); coutisEmpty(a)endl; push(a,b); coutpeek(a)endl; push(a,c); coutpeek(a)endl; coutisFull(a)endl; coutpop(a)endl; char h[]=[3*(4+9))]; coutbracketsCheck(h)endl; conversion(1348,8); } 2.迷宫求解 sqstack.h #include iostream using namespace std; const int MAXSIZE=100; struct PosType{ // 迷宫坐标位置类型 int x; // 行值 int y; // 列值 }; struct Elem{ // 栈的元素类型 int ord; // 通道块在路径上的＂序号＂ PosType seat; // 通道块在迷宫中的＂坐标位置＂ int di; // 从此通道块走向