백준 4949번 균형잡힌 세상

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

스택 개념을 이용한 문자열 처리 문제였습니다.

백준 9012번 괄호(http://jaimemin.tistory.com/754)와 유사한 문제였습니다.

#include <iostream>

#include <string>

#include <stack>

using namespace std;

 

int main(void)

{

        ios_base::sync_with_stdio(0);

        cin.tie(0);

        while (1)

        {

                 string s;

                 getline(cin, s);

                 stack<char> st;

 

                 if (s.length() == 1 && s[0] == '.')

                         break;

 

                 bool flag = true;

                 for (int j = 0; j < s.length(); j++)

                 {

                         if (s[j] == '(')

                                 st.push('(');

                         else if (s[j] == '[')

                                 st.push('[');

                         else if (s[j] == ']')

                         {

                                 if (!st.empty() && st.top() == '[')

                                          st.pop();

                                 else

                                 {

                                          flag = false;

                                          break;

                                 }

                         }

                         else if (s[j] == ')')

                         {

                                 if (!st.empty() && st.top() == '(')

                                          st.pop();

                                 else

                                 {

                                          flag = false;

                                          break;

                                 }

                         }

                 }

 

                 if (flag && st.empty())

                         cout << "yes\n";

                 else

                         cout << "no\n";

        }

        return 0;

}

개발환경:Visual Studio 2017

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