PTA 6-1 在一个数组中实现两个堆栈 (20分)

全部代码

#include <stdio.h>
#include <stdlib.h>
#include<string.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 */
Operation GetOp(){  /* details omitted */
	char c[10];
	scanf("%s",c);
	if(!strcmp("Push",c)) return push;
	if(!strcmp("Pop",c)) return pop;
	if(!strcmp("End",c)) return end;
}
void PrintStack( Stack S, int Tag ); /* details omitted */
void PrintStack( Stack S, int Tag ){ /* details omitted */
	if(Tag==1){
		printf("Pop from Stack 1: ");
		for(int i=S->Top1;i>-1;i--){
			printf("%d",S->Data[i]);
			if(i!=0) printf(" ");
		}
		printf("\n");
	}
	else{
		printf("Pop from Stack 2: ");
		for(int i=S->Top2;i<S->MaxSize;i++){
			printf("%d",S->Data[i]);
			if(i!=(S->MaxSize)-1) printf(" ");
		}
		printf("\n");
	}
}

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;
}

/* 你的代码将被嵌在这里 */
Stack CreateStack( int MaxSize ){
	Stack s;
	s = (Stack)malloc(sizeof(struct SNode)) ;
	s->MaxSize = MaxSize;
	s->Top1 = -1,s->Top2 = MaxSize;
	s->Data = (int *)malloc(sizeof(int)*MaxSize);
	return s;
} 
bool Push( Stack S, ElementType X, int Tag ){
	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 ){
	if(Tag==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)++];
	}
} 

提交代码

Stack CreateStack( int MaxSize ){
	Stack s;
	s = (Stack)malloc(sizeof(struct SNode)) ;
	s->MaxSize = MaxSize;
	s->Top1 = -1,s->Top2 = MaxSize;
	s->Data = (int *)malloc(sizeof(int)*MaxSize);
	return s;
} 
bool Push( Stack S, ElementType X, int Tag ){
	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 ){
	if(Tag==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)++];
	}
}