Nodejs 썸네일형 리스트형 [NodeJS] 프로그래머스 튜플 const solution = (s) => { const answer = []; s = JSON.parse(s.replaceAll('{', '[').replaceAll('}', ']')); s.sort((a, b) => a.length - b.length); answer.push(s[0][0]); for (let i = 1; i < s.length; i++) { const arr = s[i]; let temp = arr[0]; for (let j = 1; j < arr.length; j++) { if (!answer.includes(arr[j])) { temp = arr[j]; } } answer.push(temp); } return answer; }; 더보기 [NodeJS] 프로그래머스 위장 /** * @link https://school.programmers.co.kr/learn/courses/30/lessons/42578?language=javascript */ const solution = (clothes) => { let answer = -1; const map = {}; for (let i = 0; i pre * cur); }; 더보기 [NodeJS] 프로그래머스 베스트앨범 /** * @link https://school.programmers.co.kr/learn/courses/30/lessons/42579?language=javascript * @description */ const solution = (genres, plays) => { if (plays.length === 1) { return [0]; } const answer = []; const map = {}; const indexMap = {}; const countArr = [...new Set(genres)].map((v, i) => { indexMap[v] = i; return [v, 0]; }); if (countArr.length === 1) { const arr = []; for (let i = 0;.. 더보기 [NodeJS] 프로그래머스 완주하지 못한 선수 /** * @link https://school.programmers.co.kr/learn/courses/30/lessons/42576?language=javascript * @description */ const solution = (participant, completion) => { const map = {}; for (const p of participant) { map[p] = map[p] ? map[p] + 1 : 1; } for (const c of completion) { map[c]--; } for (const k in map) { if (map[k] > 0) { return k; } } }; 더보기 [NodeJS] 프로그래머스 음양 더하기 /** * @link https://school.programmers.co.kr/learn/courses/30/lessons/76501 * @description */ const solution = (absolutes, signs) => { return absolutes.reduce( (answer, curVal, idx) => answer + (signs[idx] ? curVal : curVal * -1), 0, ); }; 더보기 [NodeJS] 프로그래머스 없는 숫자 더하기 /** * @link https://school.programmers.co.kr/learn/courses/30/lessons/86051 * @description */ const solution = (numbers) => { return 45 - numbers.reduce((num, curNum) => num + curNum); }; 더보기 [NodeJS] 프로그래머스 기능개발 /** * @link https://school.programmers.co.kr/learn/courses/30/lessons/42586 * @description */ const solution = (progresses, speeds) => { const answer = []; const days = []; for (let i = 0; i < progresses.length; i++) { days.push(Math.ceil((100 - progresses[i]) / speeds[i])); } while (days.length) { let finishCnt = 1; let workingDay = days.shift(); while (true) { if (days[0] 더보기 [NodeJS] 백준 2981번 /** * @link https://www.acmicpc.net/problem/2981 * @description */ const readline = require('readline'); const rl = readline.createInterface({ input: process.stdin, output: process.stdout, }); const input = []; rl.on('line', (line) => { input.push(Number(line)); }).on('close', () => { const [, ...nums] = input; const result = solution(nums); console.log(result); process.exit(); }); const getGcd .. 더보기 이전 1 2 3 4 다음