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' && ..
