스택/큐 > 쇠막대기

https://programmers.co.kr/learn/courses/30/lessons/42585

1. 문제

2. 알고리즘

키워드 - 스택

3. 코드

#include <string>
#include <vector>
#include <stack>
 
using namespace std;
 
int solution(string arrangement) {
    int answer = 0;
 
    const int size = arrangement.size();
 
    stack<char> s;
    char before = 0;
    for (int i = 0; i < size; i++) {
 
        if (arrangement[i] == '(') {
            s.push(arrangement[i]);
        }
        else {
 
            s.pop();
            if (before == '(')
                answer += s.size();
            else
                answer++;
        }
 
        before = arrangement[i];
    }
    return answer;
}