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.
使用一个数组保存两个栈，只有两个栈的所有空间被使用，才应该是栈满

创建（最大容量）
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 );

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:
栈标记（Stacknum）包括1和2，最大值(MaxElements)是数组长度,数组定义如下：
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 */
}

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.
入栈成功返回1，否则返回0 .如果栈空，出栈返回在该程序中预定义的ERROR.

getop()函数,不是标准库中的函数,应该是《the c programming language》这本书中的一个例子当中的函数 ,它的作用是读取一个数值

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

    if(Stacknum==1)
    {
        //先自己加，再使用
        S->Array[++(S->Top1)]=X;
    }
    else//Stacknum==2
    {
        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)++];
}