双端顺序栈的操作

#define M 100/*双端顺序栈的操作(出栈和入栈)*/#define FALSE 0 /*2009.08.11晚，王红刚*/#define TRUE 1typedef int StackElemType;typedef struct{ StackElemType Stack[M]; int top[2];//top[0]和top[1]分别为两个栈顶指示器}DqStack;void InitStack(DqStack *s)//初始化{ s->top[0]=-1; s->top[1]=M;}int Push(DqStack *s,StackElemType x,int i)//把数据元素x压入i号堆栈{ if(s->top[0]+1==s->top[1])//栈已满 return FALSE; switch(i) { case 0: s->top[0]++; s->Stack[s->top[0]]=x; break; case 1: s->top[1]--; s->Stack[s->top[1]]=x; break; default: return FALSE; } return TRUE;}int Pop(DqStack *s,StackElemType *x,int i)//把i号栈顶元素弹出{ switch(i) { case 0: if(s->top[0]==-1) return FALSE; *x=s->Stack[s->top[0]]; printf("%d/n",*x); s->top[0]--; break; case 1: if(s->top[1]==M) return FALSE; *x=s->Stack[s->top[1]]; printf("%d/n",*x); s->top[1]++; break; default: return FALSE; } return TRUE;}void main(){ DqStack STA; int m,n,i,j; InitStack(&STA); printf("please input the i number(0 or 1):"); scanf("%d",&i); switch(i) { case 0: printf("/nplease input the 0 Stack length:"); scanf("%d",&m); printf("/nplease input the 0 stack value:"); for(j=0;j<m;j++) { scanf("%d",&n); Push(&STA,n,i); } printf("/nthe 0 stack is ok"); printf("/nthe 0 stack pop is:/n"); for(j=0;j<m;j++) { Pop(&STA,&n,i); } break; case 1: printf("/nplease input the 1 Stack length:"); scanf("%d",&m); printf("/nplease input the 1 stack value:"); for(j=0;j<m;j++) { scanf("%d",&n); Push(&STA,n,i); } printf("/nthe 1 stack is ok"); printf("/nthe 1 stack pop is:/n"); for(j=0;j<m;j++) { Pop(&STA,&n,i); } break; default: printf("the input value is ERROR!"); } }