💛 JavaScript/백준

[JS] 10989

const fs = require('fs'); const path = process.platform === 'linux' ? '/dev/stdin' : './data.txt'; const input = fs .readFileSync(path) .toString() .trim() .split('\n') .map((x) => parseInt(x)); const count = input.shift(); const solve = (input) => { const countingArr = new Array(10000 + 1).fill(0); // 가장 큰 숫자가 10000이기 때문에 10000을 인덱스로 갖는 카운팅 배열 생성 input.forEach((num) => { countingArr[num]++; });..

[JS] 2750 - Bubble sort, Selection sort

const fs = require('fs'); const path = process.platform === 'linux' ? '/dev/stdin' : './data.txt'; const input = fs .readFileSync(path) .toString() .trim() .split('\n') .map((x) => parseInt(x)); const count = input.shift(); const solveBubble = (input) => { for (let i = input.length - 1; i > 0; i--) { for (let j = 0; j input[j + 1]) { let temp = input[j + 1]; input[j + ..

[JS] 2751

const fs = require('fs'); const path = process.platform === 'linux' ? '/dev/stdin' : './data.txt'; const input = fs .readFileSync(path) .toString() .trim() .split('\n') .map((x) => parseInt(x)); const solve = (input) => { const count = input.shift(); input.sort((a, b) => a - b); console.log(input.join('\n')); }; solve(input); 백준 허어... 백준 문제 풀기 전에 짧..

[JS] 2750

const fs = require('fs'); const path = process.platform === 'linux' ? '/dev/stdin' : './data.txt'; const input = fs .readFileSync(path) .toString() .trim() .split('\n') .map((number) => parseInt(number)); const solve = (input) => { const count = input.shift(); const arr = input; const ans = input.sort((a, b) => a - b); for (let i = 0; i < ans.length; i++) { console.log(ans[i]); } }; solve(input)..

[JS] 7568

const fs = require('fs'); const path = process.platform === 'linux' ? '/dev/stdin' : './data.txt'; const input = fs.readFileSync(path).toString().trim().split('\n'); function solve(input) { const count = parseInt(input.shift()); let profile = input.map((value) => value.split(' ').map((x) => parseInt(x))); let answer = new Array(); for (let i = 0; i..