2-5 Two Stacks In One Array

Write routines to implement two stacks using only one array. Your stack routines should not declare an overflow unless every slot in the array is used.

where int Stacknum is the index of a stack which is either 1 or 2; int MaxElements is the size of the stack array; and Stack is defined as the following:

Note: Push is supposed to return 1 if the operation can be done successfully, or 0 if fails. If the stack is empty, Top_Pop must return ERROR which is defined by the judge program.

代码：

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