[Programmers] (2017 팁스타운) Lv 2. 짝지어 제거하기

https://school.programmers.co.kr/learn/courses/30/lessons/12973

프로그래머스

 

#include <iostream>
#include<string>
#include <stack>
#include <algorithm>
using namespace std;

int solution(string s)
{
    //24.10.15
    stack<char> st;
    
    for_each(s.begin(), s.end(), [&](const auto& ch) {
        (st.empty() || st.top() != ch) ? st.push(ch) : st.pop();
    });
    return st.empty();
}

GitHub : https://github.com/developeSHG/Algorithm-Baekjoon_Programmers/commit/bc839d7b6245849d6d339d95ddbad0b6420e41a0#diff-80bfd44c157f881795bbffd0a6fb879ef08e37f1b4c7da3fa72ce22b19d6d6a4

[level 2] Title: 짝지어 제거하기, Time: 5.78 ms, Memory: 6.39 MB -BaekjoonHub · developeSHG/Algorithm-Baekjoon_Programme