[자료구조] 스택 구현 _ 1차원 배열 (C++)

#include<iostream>
using namespace std;


int stack[10001];
int index = -1;

void push(int data)
{
    if(index == 10000)
    	cout << "inaccessible" << "\n";
    else
        stack[++index] = data;
}

void pop()
{
    if (index == -1)
        cout << "inaccessible" << "\n";
    else
        stack[index--] = 0;
}

int size()
{
    return index + 1;
}

bool empty()
{
    if (index == -1)
        return true;
    else
        return false;
}

int top()
{
    return stack[index];
}


int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(nullptr);
    cout.tie(nullptr);

    string order;
    int x;

   
    while (true)
    {

		cin >> order;

        if (order == "push")
        {
            cin >> x;
            push(x);
        }

        else if (order == "pop")
            pop();

        else if (order == "size")
            cout << "size : " << size() << "\n";

        else if (order == "empty")
        {
            if (empty())
                cout << "Stack is Empty" << "\n";
            else
                cout << "False" << "\n";
        }

        else if (order == "top")
            cout << "top : " << top() << "\n";

        else if (order == "print")
        {
            cout << "stack : ";
            for (int i = 0; i <= index; i++)
            {
                cout << stack[i] << " ";
            }
            cout << "\n";
        }

        else if (order == "end")
            break;

        else
            cout << "InValid Input" << "\n";
    }
    
}

 

 

 

---

출력