Baekjoon

CS/Data Structure & algorithm

[Algorithm] 백준 2304 - 창고 다각형 (Node / C#)

문제https://www.acmicpc.net/problem/2304풀이1. Node.js(fs)const fs = require('fs');const input = fs.readFileSync('/dev/stdin').toString().trim().split('\n');// 기둥의 개수 파싱const N = parseInt(input[0]);// 기둥 정보 파싱 및 정렬const pillars = input.slice(1).map(line => { const [L, H] = line.split(' ').map(Number); return { L, H };}).sort((a, b) => a.L - b.L);// 가장 높은 기둥 찾기let maxHeight = 0;let maxIndex = 0..

CS/Data Structure & algorithm

[Algorithm] 백준 2257 - 화학식량 (Node / C#)

문제https://www.acmicpc.net/problem/2257  풀이1. Node.js(fs)const fs = require('fs');const input = fs.readFileSync('/dev/stdin').toString().trim();const atomicMass = { 'H': 1, 'C': 12, 'O': 16};function calculateMass(formula) { const stack = []; for (let char of formula) { if (char === '(') { stack.push(char); } else if (char === ')') { let subM..

CS/Data Structure & algorithm

[Algorithm] 백준 1935 - 후위 표기식2 (Node / C#)

문제https://www.acmicpc.net/problem/1935 풀이1. Node.js(fs)const fs = require('fs');const input = fs.readFileSync('/dev/stdin').toString().trim().split('\n');const N = parseInt(input[0]);const expression = input[1];const values = input.slice(2).map(Number);function calculatePostfix(expr, values) { const stack = []; const operands = {}; // A부터 시작하여 각 피연산자에 값 할당 for (let i = 0; i = 'A' && ..

CS/Data Structure & algorithm

[Algorithm] 백준 1874 - 스택 수열 (Node / C#)

문제https://www.acmicpc.net/problem/1874풀이1. Node.js(fs)const fs = require('fs');const input = fs.readFileSync('/dev/stdin').toString().trim().split('\n');const n = parseInt(input[0]);const sequence = input.slice(1).map(Number);const stack = [];let result = [];let current = 1;for (let i = 0; i  2. Node.js(readLine)const readline = require('readline');const rl = readline.createInterface({ input: p..

상단으로

티스토리툴바