练习3.21 一个数组两个站栈

#include<stdio.h>
#include<stdlib.h>
struct Node;
typedef struct Node *PtrToDStack;

struct Node{
    int top1,top2;
    int Capacity;
    int  *Array;
};

PtrToDStack
CreateStack( int Size )
{
    PtrToDStack s;
    s = malloc( sizeof( struct Node ) );
    s->Array = malloc( sizeof( int ) * Size );
    s->Capacity = Size;
    return s;
}

void
Initial( PtrToDStack s, int k )
{
    if( k = 0 )
        s->top1 = -1;
    else
        s->top2 = s->Capacity;
}

int 
IsEmpty( PtrToDStack s, int k ) 
{
    if( k == 0 )
        return s->top1 == -1;
    else
        return s->top2 == Size;
}

int 
IsFull( PtrToDStack s )
{
    return s->top1 + 1 == s->top2;
}

void
Push( PtrToDStack s, int k, int x )
{
    if( !IsFull( s ) )
    {
        if( k == 0 )
            s->Array[ ++s->top1 ] = x;
        else
            s->Array[ --s->top2 ] = x;
    }
    else
        Error("stack is full");
}

void
Pop( PtrToDStack s, int k )
{
    if( k == 0 )
    {
        if( !IsEmpty( s, 0 ) )
            s->top1--;
        else
            Error("");
    }
    else
    {
        if( !IsEmpty( s, 1 ) )
            s->top2--;
        else
            Error("no ele")
    }
}

int 
Top( PtrToDStack s, int k )
{
    if( k == 0 )
    {
        if( !IsEmpty( s, k ) )
            return s->Array[ s->top1 ];
        else
            Error;
    }
    else
    {
        if( !IsEmpty(s,k) )
            return s->Array[ s->top2 ];
        else
            Error;
    }
}