算法:C语言实现 (4)下推栈的数组实现

#include <stdlib.h>
#include "item.h"

static Item *s;
static int N;

void STACKinit(int maxN)
{
    s = (Item*)malloc(maxN*sizeof(Item));
    N = 0;
}

int STACKempty()
{
    return N == 0;
}

void STACKpush(Item item)
{
    s[N++] = item;
}

Item STACKpop()
{
    return s[--N];
}