백준 10828번 스택

문제 링크입니다: https://www.acmicpc.net/problem/10828

백준 10845번 큐(http://jaimemin.tistory.com/661)처럼 자료구조를 복습하는 문제였습니다.

스택에 대한 개념을 안다면 어렵지 않게 풀 수 있는 문제였습니다.

#include <iostream>

#include <string>

#include <stack>

using namespace std;

 

int N;

stack<int> s;

 

int main(void)

{

        cin >> N;

 

        for (int i = 0; i < N; i++)

        {

                 string command;

                 cin >> command;

 

                 if (command == "push")

                 {

                         int num;

                         cin >> num;

 

                         s.push(num);

                 }

                 else if (command == "pop")

                 {

                         if (!s.empty())

                         {

                                 cout << s.top() << endl;

                                 s.pop();

                         }

                         else

                                 cout << -1 << endl;

                 }

                 else if (command == "size")

                         cout << s.size() << endl;

                 else if (command == "empty")

                         cout << s.empty() << endl;

                 else if (command == "top")

                 {

                         if (!s.empty())

                                 cout << s.top() << endl;

                         else

                                 cout << -1 << endl;

                 }

        }

        return 0;

}

개발환경:Visual Studio 2017

지적, 조언, 질문 환영입니다! 댓글 남겨주세요~