数据结构：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.

Format of functions:

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:

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.

Sample program of judge:

#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_s("%d", &N);
    S = CreateStack(N);
    while (!done) {
        switch (GetOp()) {
           case push:
                scanf_s("%d %d", &Sn, &X);   
                if (!Push(X, S, Sn)) printf("Stack %d is Full!\n", Sn);
                break;
           case pop:
                scanf_s("%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;
}

/* Your function will be put here */

Sample Input:

5
Push 1 1
Pop 2
Push 2 11
Push 1 2
Push 2 12
Pop 1
Push 2 13
Push 2 14
Push 1 3
Pop 2
End

Sample Output:

Stack 2 is Empty!
Stack 1 is Full!
Pop from Stack 1: 1
Pop from Stack 2: 13 12 11

实现：

Stack CreateStack(int MaxElements)//定义一个数组，MaxElements代表数组大小；top1指向头，代表第一个stack，从头往后存；top2指向尾，代表第二个stack，从后往前存。
{
    Stack s = (Stack)malloc(sizeof(struct StackRecord));
    s->Array = (int*)malloc(MaxElements*sizeof(int));
    s->Top1 = -1;
    s->Top2 = MaxElements;
    s->Capacity = MaxElements;
    return s;
}

int IsEmpty(Stack S, int Stacknum)//用于判断stack是否为空
{
    if (Stacknum == 1)
    {
        if (S->Top1 == -1)
            return 1;
        else
            return 0;
    }
    else
    {
        if (S->Top2 == S->Capacity)
            return 1;
        else
            return 0;
    }
}

int IsFull(Stack S)//用于判断stack是否已满，方法：top1从前往后扫，top2从后往前扫，所以top1的下一个为top2时，就说明stack已满
{
    if (S->Top2 - S->Top1 == 1)
        return 1;
    else
        return 0;
}

int Push(ElementType X, Stack S, int Stacknum)//插入元素，需要考虑stack是否存满
{
    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)//删除元素，需考虑stack是否为空
{
    if (IsEmpty(S, Stacknum))
        return ERROR;
    if (Stacknum == 1)
        return S->Array[(S->Top1)--];
    else
        return S->Array[(S->Top2)++];
}