문제https://www.acmicpc.net/problem/6105 풀이1. Node.js(fs)const fs = require('fs');const input = fs.readFileSync('/dev/stdin').toString().trim().split('\n');const N = parseInt(input[0]);const heights = input.slice(1).map(Number);function findLookUp(heights) { const stack = []; const result = new Array(N).fill(0); for (let i = N - 1; i >= 0; i--) { while (stack.length > 0 && heights[..
문제https://www.acmicpc.net/problem/5966 풀이1. Node.js(fs)const fs = require('fs');const input = fs.readFileSync('/dev/stdin').toString().trim().split('\n');const N = parseInt(input[0]);function isLegal(pattern) { const stack = []; for (let char of pattern) { if (char === '>') { stack.push(char); } else if (char === '') { return false; } ..
문제https://www.acmicpc.net/problem/5957 풀이1. Node.js(fs)const fs = require('fs');const input = fs.readFileSync('/dev/stdin').toString().trim().split('\n');const N = parseInt(input[0]);let unwashed = Array.from({length: N}, (_, i) => N - i);let washed = [];let dried = [];for (let i = 1; i 0) { washed.push(unwashed.pop()); } } } else { // Canmuu drying f..
문제https://www.acmicpc.net/problem/5397 풀이1. Node.js(fs)const fs = require('fs');const input = fs.readFileSync('/dev/stdin').toString().trim().split('\n');const T = parseInt(input[0]);function processKeyLogger(str) { const leftStack = []; const rightStack = []; for (let char of str) { if (char === ' 0) { rightStack.push(leftStack.pop()); } } else i..
