yusijia’s blog 栈

const int MAX_SIZE = 1000;
int sizes = 0;
int sta[MAX_SIZE];

void (int data)
{
    sta[sizes++] = data;
}

int pop()
{
    return sta[--sizes];
}

int top()
{
    return sta[sizes - 1];
}

bool isEmpty()
{
    return sizes == 0 ;
}

bool isFull()
{
    return sizes == MAX_SIZE;
}