6-7 在一个数组中实现两个堆栈

（20 point(s)） 本题要求在一个数组中实现两个堆栈。
https://pintia.cn/problem-sets/15/problems/730
函数接口定义：

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。

https://www.cnblogs.com/zengguoqiang/p/8385499.html
参考以上链接做的题 //哈哈博客写得太逗了

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


Stack CreateStack( int MaxSize ){
	Stack S = (Stack)malloc(sizeof(struct SNode));
	S->Data = (ElementType*)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 == NULL) return ERROR; 
	if(S->Top1 + 1 == S->Top2){
		printf("Stack Full");
		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(S == NULL) return ERROR;
	if(Tag == 1){
		if(S->Top1 == -1){
			return ERROR;
		}	
		return S->Data[S->Top1--];
	}else{
		if(S->Top2 == S->MaxSize){
			return ERROR;
		}	
		return S->Data[S->Top2++];
	}
}
Operation GetOp()
{
    char Push[] = "Push";
    char Pop[] = "Pop";
    char End[] = "End";
    char s[100];
    scanf("%s", s);

    if (strcmp(Push, s) == 0)return push;
    if (strcmp(Pop, s) == 0)return pop;
    if (strcmp(End, s) == 0)return end;
}
void PrintStack(Stack S, int Tag)
{
    printf("Pop from Stack %d:", Tag);
    if (Tag == 1){
        while (S->Top1 != -1){
            printf(" %d", S->Data[S->Top1--]);
        }
    }
    else {
        while (S->Top2 != S->MaxSize){
            printf(" %d", S->Data[S->Top2++]);
        }
    }
    putchar('\n');
}