版权声明:如需转载请博客下面留言,并在转载时请标明出处,并附带链接! https://blog.csdn.net/patrick_star_cowboy/article/details/80008307
头文件部分,已经栈的结构体
#define MAX_SIZE 20
#define OK 1
#define ERROR 0
#define TRUE 1
#define FALSE 0
typedef int SElemType;
typedef int Status;
#define MAXSIZE 100
typedef struct
{
SElemType data[MAXSIZE];
int top1, top2;
} SqDoubleStack;
函数实现部分,实际上就是两个栈公用一个数组,这里必须要两个类型相同,否则得不偿失!!
Status Push(SqDoubleStack *L, SElemType e, int stackNumebr) //压栈
{
if (L->top1 + 1 == L->top2)
{
return ERROR;
}
if (stackNumebr == 1)
{
L->data[++L->top1] = e;
}
else if (stackNumebr == 2)
{
L->data[--L->top2] = e;
}
return OK;
}
Status Pop(SqDoubleStack *L, SElemType *e, int stackNumber) //出栈
{
if (stackNumber == 1)
{
if (L->top1 == -1)
{
return ERROR;
}
*e = L->data[L->top1--];
}
else if (stackNumber == 2)
{
if (L->top2 == MAXSIZE)
{
return ERROR;
}
*e = L->data[L->top2++];
}
return OK;
}