백준 알고리즘 [10828번] (C++) 스택

---

Code

#include <iostream>
using namespace std;

#define MAX 1000000

int arr[MAX], point;

class stack
{
public:
    void push(int data)
    {
        arr[point++] = data;
    }
    void pop()
    {
        cout << arr[point - 1] << "\n";
        arr[point - 1] = 0;
        point--;
    }
    int size()
    {
        return point;
    }
    bool empty()
    {
        if (point == 0)
            return true;
        else
            return false;
    }
    void top()
    {
        if (point <= 0)
            cout << -1 << "\n";
        else
            cout << arr[point - 1] << "\n";
    }
};

int main()
{
    stack s;
    string command;

    int count = 0;

    cin >> count;

    while (count--)
    {
        cin >> command; // 명령어 입력

        if (command == "push")
        {
            int data = 0;
            cin >> data;
            s.push(data);
        }
        else if (command == "pop")
        {
            if (s.empty() == 1)
                cout << -1 << endl;
            else
                s.pop();
        }
        else if (command == "size")
        {
            cout << s.size() << "\n";
        }
        else if (command == "empty")
        {
            cout << s.empty() << "\n";
        }
        else if (command == "top")
        {
            s.top();
        }
    }
}