CS

CS/Data Structure & algorithm

[Algorithm] 백준 4889 -안정적인 문자열 (Node / C#)

문제https://www.acmicpc.net/problem/4889 풀이1. Node.js(fs)const fs = require('fs');const input = fs.readFileSync('/dev/stdin').toString().trim().split('\n');const numCases = parseInt(input[0]);function evaluateExpression(expr) { const stack = []; for (let i = 0; i  2. Node.js(readLine)const readline = require('readline');const rl = readline.createInterface({ input: process.stdin, output..

CS/Data Structure & algorithm

[Algorithm] 백준 4466 - A Smart Brain is a Tasty Brain (Node / C#)

문제https://www.acmicpc.net/problem/4466 풀이1. Node.js(fs)const fs = require('fs');const input = fs.readFileSync('/dev/stdin').toString().trim().split('\n');const numCases = parseInt(input[0]);function evaluateExpression(expr) { const stack = []; for (let i = 0; i  2. Node.js(readLine)const readline = require('readline');const rl = readline.createInterface({ input: process.stdin, output..

CS/Data Structure & algorithm

[Algorithm] 백준 4227 - Smeech (Node / C#)

문제https://www.acmicpc.net/problem/4227풀이1. Node.js(fs)const fs = require('fs');const input = fs.readFileSync('/dev/stdin').toString().trim().split('\n');function evaluateSmeech(expr) { if (!isNaN(expr)) { return parseFloat(expr); } expr = expr.slice(1, -1); // 바깥쪽 괄호 제거 let p = parseFloat(expr); let rest = expr.slice(expr.indexOf(' ') + 1); let openBrackets = 0; l..

CS/Data Structure & algorithm

[Algorithm] 백준 3986 - 좋은 단어 (Node / C#)

문제https://www.acmicpc.net/problem/3986풀이1. Node.js(fs)const fs = require('fs');const input = fs.readFileSync('/dev/stdin').toString().trim().split('\n');const N = parseInt(input[0]);let goodWordCount = 0;function isGoodWord(word) { const stack = []; for (let char of word) { if (stack.length > 0 && stack[stack.length - 1] === char) { stack.pop(); } else { ..

상단으로

티스토리툴바