๋ฐ์ํ ๐ ์๊ณ ๋ฆฌ์ฆ/๋ฐฑ์ค JS21 [๋ฐฑ์ค] node.js/ 3986 ์ข์ ๋จ์ด ๐ ์ฝ์ง๋ค 1. ๋ฐ์ฉ ๋๋ ์ ํ๋ฉด ์ด๋จ๊น? AABB์ธ๊ฒฝ์ฐ ์๋ง์ let cnt = 0; let wordStack = []; for (let i = 0; i < n; i++) { const word = input[i]; if (word.length % 2 !== 0) continue; const halfLen = word.length / 2; const prevWord = word.slice(0, halfLen).split(''); const nextWord = word.slice(halfLen).split(''); for (let j = 0; j < halfLen; j++) { const next = nextWord[j]; const prev = prevWord[halfLen - 1 - j]; conso.. 2021. 10. 14. [๋ฐฑ์ค] node.js/ 2164 ์นด๋2 ์ฒ์ ํ์ด (์๊ฐ ์ด๊ณผ) const fs = require('fs'); let input = (fs.readFileSync('./test') + '').toString().trim(); const numArr = Array.from({ length: parseInt(input) }, (v, i) => i + 1); while (numArr.length > 1) { numArr.shift(); numArr.push(numArr.shift()); } console.log(numArr[0]); ๋ฐฐ์ด์ ๋๋ฉฐ ๊ธธ์ด๊ฐ 1์ด๋ ๋๊น์ง 1. ์ฒซ ๋ฒ์งธ ๊ฐ ์ ๊ฑฐ 2. ์ฒซ ๋ฒ์งธ ๊ฐ ๋ค๋ก ๋ถ์ด๊ธฐ ๋ฐ๋ณตํ์ง๋ง... ์๊ฐ์ด๊ณผ ๊ฒ์ํด ๋ณด๋ ๋ฐฐ์ด์ push ,pop ์ ์ด์ฉํ๋ฉด ์๊ฐ์ด๊ณผ๊ฐ ๋ฌ๋ค๊ณ ํ๋ค. ๋ฐฐ์ด์ ์ฐ์ฐ์๊ฐ์ ๋งจ ์ ์์์ .. 2021. 10. 13. [๋ฐฑ์ค] node.js / 1158 ์์ธํธ์ค ๋ฌธ์ ์ฒ์ ํ์ด const fs = require('fs'); let input = (fs.readFileSync('./test') + '').toString().trim().split(' '); let [n, k] = input.map((n) => parseInt(n)); let ansArr = []; const arr = Array.from({ length: n }, (v, i) => i + 1); for (let i = 0; i i + 1); let cnt = 0; while (arr.length > 0) { c.. 2021. 10. 12. [๋ฐฑ์ค] JS/ 11399 ATM ใ ๋ด ํ์ด1 const fs = require('fs'); let input = (fs.readFileSync('./test') + '').toString().trim().split('\n'); const line = input[1].split(' ').map(Number); const sortLine = line.sort((a, b) => a - b); let ans = 0; let prev = 0; sortLine.forEach((l) => { prev += l; ans += prev; }); console.log(ans); 1. ๋ฐฐ์ด์ ์ ๋ ฌํ ํ 2. ๋ต์ ๋ํด์ค ๋ด ํ์ด2 const fs = require("fs"); const [n, input] = fs.readFileSync('/dev/std.. 2021. 10. 6. [๋ฐฑ์ค] JS/ 1157 ๋จ์ด ๊ณต๋ถ ๋ด ํ์ด const fs = require('fs'); let input = (fs.readFileSync('./test') + '').toString().trim(); let inputArr = input.split(''); let ans = {}; inputArr.forEach((i) => { let ui = i.toUpperCase(); if (ans[ui]) ans[ui] += 1; else ans[ui] = 1; }); let a = Object.keys(ans).sort((a, b) => { return ans[b] - ans[a]; }); if (a.length === 1) console.log(a[0]); else { if (ans[a[0]] !== ans[a[1]]) console.log.. 2021. 10. 5. [๋ฐฑ์ค] JS/ 10808 ์ํ๋ฒณ ๊ฐ์ ๋ด ํ์ด const fs = require('fs'); let input = (fs.readFileSync('./test') + '').toString().trim().split(''); let ans = new Array(26).fill(0); input.map((alpha) => { let alpha2Ascii = alpha.charCodeAt(0); ans[alpha2Ascii - 97] += 1; }); console.log(ans.join(' ')); ์ ๋ง ๋จ์ํ ๋ฐ์ ๋ฌธ์์ด์ ๋ฐฐ์ด๋ก ๋๋ฉฐ Ascii๋ก ๋ฐ๊ฟ์ฃผ๊ณ ํด๋น ๋ฐฐ์ด์ idx-97 (a = 97)์ ๋ฃ์ด์ฃผ๊ธฐ! ๋ค๋ฅธ ํ์ด const s = require("fs").readFileSync("/dev/stdin").toString().split(.. 2021. 9. 30. [๋ฐฑ์ค] JS/ 4949 ๊ท ํ์กํ ์ธ์ โ.์ค์ ๋ฐฑ์ค ํ์ด์์๋ fs.readFileSync('./test') -> fs.readFileSync('./dev/stdin') ์ด๋ ๊ฒ ๊ณ ์ณ์ ์๊ฐํด์ฃผ์ธ์ ์ฒ์ ํ์ด๋ ์์ ํ ์๋ชป ์๊ฐํ๋ค. ๋๊ฐ์ ๊ฐ์๋ง ๋ง์ผ๋ฉด ๋๋ค๊ณ ์๊ฐํด์ ์ ๊ทํํ์์ผ๋ก ์ ์ฑ์ค๋ฝ๊ฒ ์ด์ํ ์ฝ๋๋ฅผ ์จ๋ด๋ ค๊ฐ๋ค..^^ ์ฒ์ ํ์ด ( ๋ฐฉํฅ ์์ ์๋ชป ) const fs = require('fs'); let input = (fs.readFileSync('./test') + '').toString().trim().split('.'); input.pop(); input.pop(); console.log(input); const regL = /\[/g; const regR = /\[/g; const regl = /\(/g; const regr.. 2021. 9. 29. [๋ฐฑ์ค] JS/ 10798 ์ธ๋ก์ฝ๊ธฐ ๋ด ํ์ด1(์ค๋ต) const fs = require('fs'); let input = (fs.readFileSync('./dev/stdin') + '').split('\n'); let ans = ''; const wordArr = input.map((i) => i.split('')); const turnCnt = wordArr.length; let allCnt = 0; while (allCnt { if (word[0] !== undefined) ans += word.shift(); else allCnt += 1; }); } console.log(ans); 1. ๊ธ์๋ฅผ ์์ ๊ฐ์ ์ด์ค๋ฐฐ์ด๋ก ์์ฑ 2. ์ด ๋ฐฐ์ด์ ๊ธธ์ด => ๊ฐ์๋ก ๋๊ณ 3.. 2021. 9. 29. [๋ฐฑ์ค] JS/ 14561 ํ๋ฌธ ํ์ค์ ๋ฐ์๋ค์ฌ์ผ ํ๋ค. ๋ฐ๋ก Node.js ๋ก ์๊ณ ๋ฆฌ์ฆ์ ์ฐ์ตํด์ผ ํ๋ค๋ ์ฌ์ค์! ๋ด ํ์ด (์ ๋ต) const fs = require('fs'); const input = fs.readFileSync('/dev/stdin').toString().trim().split('\n').map((e) => e.split(' ').map(Number));; input.shift(); const nArr = input.map((arr) => { const [num, n] = [arr[0], arr[1]]; return num.toString(n); }); const isPalindrome = (num) => { let lenNum = num.length; let hLenNum = Math.floor(num.leng.. 2021. 9. 27. ์ด์ 1 2 3 ๋ค์ ๋ฐ์ํ