本题要求在一个数组中实现两个堆栈。
函数接口定义:
Stack CreateStack( int MaxSize );
bool Push( Stack S, ElementType X, int Tag );
ElementType Pop( Stack S, int Tag );
其中Tag是堆栈编号,取1或2;MaxSize堆栈数组的规模;Stack结构定义如下:
typedef int Position;
struct SNode {
ElementType *Data;
Position Top1, Top2;
int MaxSize;
};
typedef struct SNode *Stack;
注意:如果堆栈已满,Push函数必须输出“Stack Full”并且返回false;如果某堆栈是空的,则Pop函数必须输出“Stack Tag Empty”(其中Tag是该堆栈的编号),并且返回ERROR。
裁判测试程序样例:
在这里插入代码片
```#include <stdio.h>
#include <stdlib.h>
#define ERROR 1e8
typedef int ElementType;
typedef enum { push, pop, end } Operation;
typedef enum { false, true } bool;
typedef int Position;
struct SNode {
ElementType *Data;
Position Top1, Top2;
int MaxSize;
};
typedef struct SNode *Stack;
Stack CreateStack( int MaxSize );
bool Push( Stack S, ElementType X, int Tag );
ElementType Pop( Stack S, int Tag );
Operation GetOp(); /* details omitted */
void PrintStack( Stack S, int Tag ); /* details omitted */
int main()
{
int N, Tag, X;
Stack S;
int done = 0;
scanf("%d", &N);
S = CreateStack(N);
while ( !done ) {
switch( GetOp() ) {
case push:
scanf("%d %d", &Tag, &X);
if (!Push(S, X, Tag)) printf("Stack %d is Full!\n", Tag);
break;
case pop:
scanf("%d", &Tag);
X = Pop(S, Tag);
if ( X==ERROR ) printf("Stack %d is Empty!\n", Tag);
break;
case end:
PrintStack(S, 1);
PrintStack(S, 2);
done = 1;
break;
}
}
return 0;
}
实现:
```c
//对双堆栈的创建
Stack CreateStack( int MaxSize ){
Stack S=(Stack)malloc(sizeof(struct SNode));
S->Data=(ElementType*)malloc(MaxSize*sizeof(ElementType));
S->Top1=-1;//堆栈1的栈顶指针
S->Top2=MaxSize;//堆栈2的栈顶指针
S->MaxSize=MaxSize;
return S;
}
bool Push( Stack S, ElementType X, int Tag ){
//Tag是作为区分两个堆栈的标志,取值为1和2
//判断堆栈满
if((S->Top2)-(S->Top1)==1){
printf("Stack Full\n");
return false;
}
if(Tag==1){
S->Data[++(S->Top1)]=X;
}else{
S->Data[--(S->Top2)]=X;
}
return true;
}
ElementType Pop( Stack S, int Tag ){
//Tag是作为区分两个堆栈的标志,取值为1和2
//判断堆栈满
if(Tag==1){//对堆栈1进行判断
if((S->Top1)==-1){
printf("Stack %d Empty\n",Tag);
return ERROR;
}
return (S->Data[(S->Top1)--]);
}
else{
if((S->Top2)==S->MaxSize){
printf("Stack %d Empty\n",Tag);
return ERROR;
}
return (S->Data[(S->Top2)++]);
}
}