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

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

프로그래머스

 

#include <iostream>
#include <string>
#include <algorithm>
#include <stack>

using namespace std;

int solution(string s)
{
    stack<char> _stack;

    for_each(&s[0], &s[0] + s.length(), [&](char& n) 
    {
        (!_stack.size() || _stack.top() != n) ? _stack.push(n) : _stack.pop();
    });

    return _stack.empty();
}

GitHub : https://github.com/developeSHG/Algorithm-Baekjoon_Programmers/blob/833f138c495f3762a2418f8d8a066b84971f8767/%ED%94%84%EB%A1%9C%EA%B7%B8%EB%9E%98%EB%A8%B8%EC%8A%A4/lv2/12973.%E2%80%85%EC%A7%9D%EC%A7%80%EC%96%B4%E2%80%85%EC%A0%9C%EA%B1%B0%ED%95%98%EA%B8%B0/%EC%A7%9D%EC%A7%80%EC%96%B4%E2%80%85%EC%A0%9C%EA%B1%B0%ED%95%98%EA%B8%B0.cpp

GitHub - developeSHG/Algorithm-Baekjoon_Programmers: 백준 and 프로그래머스 소스코드