10828 스택

https://www.acmicpc.net/problem/10828

10828번: 스택

 

 

 

 

 

 

 

 

 

#include <iostream>
using namespace std;

const int MAX = 10000;

class bojStack
{
private:
	int* stackMem;
	int top, max;

public:
	bojStack() : top(0), max(MAX)
	{
		stackMem = new int[MAX];
	};
	~bojStack()
	{
		delete[] stackMem;
	}

	void Push(const int data);
	int Pop();
	int Size();
	bool Empty();
	int Top();

	bool Full();
};

void bojStack::Push(const int data)
{
	Full() ? NULL : stackMem[top++] = data;
}

int bojStack::Pop()
{
	if (top == 0)
		return -1;

	return Full() ? NULL : stackMem[--top];
}

int bojStack::Size()
{
	return top;
}

bool bojStack::Empty()
{
	return top == 0;
}

int bojStack::Top()
{
	if (top == 0)
		return -1;

	return stackMem[top - 1];
}

bool bojStack::Full()
{
	return top == MAX;
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);

	int N;
	cin >> N;

	string order[5] = { "push", "pop", "size", "empty", "top" };
	bojStack bjstck;

	for (int i = 0; i < N; i++)
	{
		string order;
		cin >> order;

		if (order == "push")
		{
			int data = 0;
			cin >> data;

			bjstck.Push(data);
		}
		else if (order == "pop")
			cout << bjstck.Pop() << "\n";
		else if (order == "size")
			cout << bjstck.Size() << "\n";
		else if (order == "empty")
			cout << bjstck.Empty() << "\n";
		else if (order == "top")
			cout << bjstck.Top() << "\n";
	}

	return 0;
}