다윤 풀이
const filePath = process.platform === "linux" ? "/dev/stdin" : "input.txt"; let [N, ...inputs] = require("fs") .readFileSync(filePath) .toString() .trim() .split("\n"); let answer = 0; inputs.forEach((input) => { const word = input.trim(); const stack = []; word.split("").forEach((w) => { const top = stack[stack.length - 1]; if (stack.length === 0 || top !== w) { stack.push(w); } else { stack.pop(); } }); if (stack.length == 0) answer++; }); console.log(answer);
민수 풀이
let [N,...arr] = require('fs').readFileSync("/dev/stdin").toString().trim().split("\n"); let cnt = 0; arr.forEach(e => { let value = e.trim(); let stack = []; for(let i = 0; i < value.length; i++){ stack[stack.length-1] === value[i] ? stack.pop() : stack.push(value[i]); } if(stack.length === 0) cnt += 1; }) console.log(cnt);