共享空间的两栈
#include <stdio.h>
#include <stdlib.h>
#define Error(Str) FatalError(Str)
#define FatalError(Str) fprintf(stderr,"%s\n",Str),exit(1)
#define EmptyPos (-1)
#define MiStackSize (5)
#define StackIncrement (2)
#define MAXSIZE 20
#define OK 1
#define ERROR 0
#define TRUE 1
#define FALSE 0;
typedef int SElemType;
typedef int Status;
typedef struct{
SElemType data[MAXSIZE];
int top1;
int top2;
}SqDoubleSatck;
Status visit(SElemType c){
printf("%d ",c);
return OK;
}
Status InitStack(SqDoubleSatck *s){
s->top1=-1;
s->top2=MAXSIZE;
return OK;
}
Status ClearStack(SqDoubleSatck* s){
s->top1=-1;
s->top2=MAXSIZE;
return OK;
}
Status StackEmpty(SqDoubleSatck s){
if(s.top1==-1 && s.top2==MAXSIZE)
return TRUE;
else
return FALSE;
}
int StackLength(SqDoubleSatck s){
return (s.top1+1)+(MAXSIZE-s.top2);
}
Status Push(SqDoubleSatck *s,SElemType e,int stackNumber){
if(s->top1==s->top2)
return ERROR;
if(stackNumber==1)
s->data[++s->top1]=e;
else if(stackNumber==2)
s->data[--s->top2]=e;
return OK;
}
Status Pop(SqDoubleSatck *s,SElemType *e,int stackNumber){
if(stackNumber==1){
if(s->top1==-1)
return ERROR;
*e=s->data[s->top1--];
}else if(stackNumber==2){
if(s->top2==MAXSIZE)
return ERROR;
*e=s->data[s->top2++];
}
return OK;
}
Status StackTraverse(SqDoubleSatck s){
int i=0;
while(i<s.top1)
visit(s.data[i++]);
i=s.top2;
while(i<MAXSIZE)
visit(s.data[i++]);
printf("\n");
return OK;
}
int main(){
int j;
SqDoubleSatck s;
int e;
if(InitStack(&s)==OK){
for(j=1;j<=5;j++)
Push(&s,j,1);
for(j=MAXSIZE;j>=MAXSIZE-2;j--)
Push(&s,j,2);
}
Pop(&s,&e,2);
return 0;
}
递归和栈