程序员面试金典（8）一个数组实现三个栈

#include <iostream>
#include <string>
#include <map>
#include <stack>
using namespace std;

int stackSize = 100;
int* buffer = new int[stackSize * 3];
int stackPointer[3] = {-1, -1, -1};

void push(int stackNum, int value)
{
    if (stackPointer[stackNum] + 1 >= stackSize)
    {
        return;
    }
    stackPointer[stackNum]++;
    int index = stackNum * stackSize + stackPointer[stackNum];
    buffer[index] = value;
}

int top(int stackNum)
{
    int index = stackNum * stackSize + stackPointer[stackNum];
    return buffer[index];
}

bool isEmpty(int stackNum)
{
    return stackPointer[stackNum] == -1;
}

void pop(int stackNum)
{
    if (stackPointer[stackNum] == -1)
    {
        return;
    }
    stackPointer[stackNum]--;
}

int main()
{
    
    //getchar();
    return 0;
}