Two stack in one array

实现两个栈公用一个数组

今天做到的一个ADT的题目
基本思路是一个栈从左往右，另一从右往左

    #include <stdio.h>
    include <stdlib.h>
    define ERROR 1e8
    typedef int ElementType;
    typedef enum { push, pop, end } Operation;

    typedef struct StackRecord *Stack;
    struct StackRecord  {
    int Capacity;       /* maximum size of the stack array */
    int Top1;           /* top pointer for Stack 1 */
    int Top2;           /* top pointer for Stack 2 */
    ElementType *Array; /* space for the two stacks */
};

Stack CreateStack( int MaxElements );
int IsEmpty( Stack S, int Stacknum );
int IsFull( Stack S );
int Push( ElementType X, Stack S, int Stacknum );
ElementType Top_Pop( Stack S, int Stacknum );

Operation GetOp();  /* details omitted */
void PrintStack( Stack S, int Stacknum ); /* details omitted */

int main()
{
    int N, Sn, X;
    Stack S;
    int done = 0;

    scanf("%d", &N);
    S = CreateStack(N);
    while ( !done ) {
        switch( GetOp() ) {
        case push: 
            scanf("%d %d", &Sn, &X);
            if (!Push(X, S, Sn)) printf("Stack %d is Full!\n", Sn);
            break;
        case pop:
            scanf("%d", &Sn);
            X = Top_Pop(S, Sn);
            if ( X==ERROR ) printf("Stack %d is Empty!\n", Sn);
            break;
        case end:
            PrintStack(S, 1);
            PrintStack(S, 2);
            done = 1;
            break;
        }
    }
    return 0;
}

---

题目部分如上
需要实现的函数

Stack CreateStack( int MaxElements );
int IsEmpty( Stack S, int Stacknum );
int IsFull( Stack S );
int Push( ElementType X, Stack S, int Stacknum );
ElementType Top_Pop( Stack S, int Stacknum );

具体实现：

Stack CreateStack( int MaxElements )
{
    Stack stack =(Stack)malloc(sizeof(struct StackRecord));
    stack->Array = (ElementType *)malloc(sizeof(ElementType)*MaxElements);
    stack->Capacity=MaxElements;
    stack->Top1=-1;
    stack->Top2=MaxElements;
    return stack;
}
int IsEmpty( Stack S, int Stacknum )
{
    if(Stacknum==1)
    {
        return S->Top1==-1;
    }
    if(Stacknum==2)
    {
        return S->Top2==S->Capacity;
    }
}
int IsFull( Stack S )
{
    return S->Top2-S->Top1==1;
}
int Push( ElementType X, Stack S, int Stacknum )
{
    if(IsFull(S)) return 0;
    if(Stacknum==1)
    {
        S->Array[++S->Top1]=X;
    }
    else
    {

        S->Array[--S->Top2]=X;
    }
    return 1;
}
ElementType Top_Pop( Stack S, int Stacknum )
{
    if(IsEmpty(S,Stacknum)) return ERROR;
    if(Stacknum==1)
    {
        return S->Array[S->Top1--];
    }
    if(Stacknum==2)
    {
        return S->Array[S->Top2++];
    }
}