(프로그래머스) 짝지어 제거하기

문제 링크

https://programmers.co.kr/learn/courses/30/lessons/12973?language=javascript

Javascript

function solution(s) {
  const stack = [];

  for(let i = 0; i < s.length; i++){
    if( !stack.length || stack[stack.length-1] !== s[i] ) stack.push(s[i]);
    else stack.pop();
  }

  return stack.length ? 0 : 1;
}