本题要求在一个数组中实现两个堆栈。
函数接口定义:
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;
}
/* 你的代码将被嵌在这里 */
输入样例:
5
Push 1 1
Pop 2
Push 2 11
Push 1 2
Push 2 12
Pop 1
Push 2 13
Push 2 14
Push 1 3
Pop 2
End
输出样例:
Stack 2 Empty
Stack 2 is Empty!
Stack Full
Stack 1 is Full!
Pop from Stack 1: 1
Pop from Stack 2: 13 12 11
题意就是利用顺序栈的单向延展性,使用一个数组来存储两个栈。让一个栈的栈底为该数组的始端,另一个栈的栈底为该数组的末端。每个栈从各自的端点向中间延伸。
此时判断栈为空的条件就是
1.s->Top1==-1;
2.s->Top==MAXSIZE;
判断栈满的条件就是
s->Top1+1=s->Top2
要注意的是:进出栈的时候 ,不同的栈+ -不一样,符号很容易弄错!
代码实现:
Stack CreateStack( int MaxSize )
{
Stack s=(Stack)malloc(sizeof(struct SNode));
s->Data =(int*)malloc(sizeof(ElementType )*MaxSize);
s->Top1 =-1;//从数组始端开始
s->Top2 =MaxSize;//从数组末端开始
s->MaxSize =MaxSize;
return s;
}
bool Push( Stack S, ElementType X, int Tag )
{
if(S->Top1 +1==S->Top2 )//栈满
{
printf("Stack Full\n");
return false;
}
if(Tag==1)
{
S->Top1 ++;
S->Data[S->Top1 ]=X;
}
else if(Tag==2)
{
S->Top2 --;
S->Data[S->Top2 ]=X;
}
return true;
}
ElementType Pop( Stack S, int Tag )
{
if(Tag==1)
{
if(S->Top1 ==-1)//判断栈空
{
printf("Stack %d Empty\n",Tag);
return ERROR;
}
else
{
return S->Data[S->Top1--];
}
}
else if(Tag==2)
{
if(S->Top2 ==S->MaxSize )//判断栈空
{
printf("Stack %d Empty\n",Tag);
return ERROR;
}
else
return S->Data[S->Top2++];
}
}