오늘도 코딩하나
[백준_javascript] 1차원 배열(10810, 10813, 5597) 본문
#10810 (공 넣기)
const fs = require('fs');
const file = process.platform === 'linux' ? '/dev/stdin' : __dirname+'/input.txt';
const input = fs.readFileSync(file).toString().trim().split('\n');
let [n,m] = input[0].split(' ').map(Number);
let arr = Array(n).fill(0);
for(let i=1; i<=m; i++) {
let [a,b,c] = input[i].split(' ').map(Number);
for(let j=a-1; j<b; j++) {
arr[j] = c;
}
}
console.log(arr.join(' '));
#10813 (공 바꾸기)
const fs = require('fs');
const file = process.platform === 'linux' ? '/dev/stdin' : __dirname+'/input.txt';
const input = fs.readFileSync(file).toString().trim().split('\n');
let [n,m] = input[0].split(' ').map(Number);
let arr = Array(n).fill().map((x,y) => y+1);
for(let l=1; l<=m; l++) {
let [i,j] = input[l].split(' ').map(Number);
temp = arr[i-1];
arr[i-1] = arr[j-1];
arr[j-1] = temp;
}
console.log(arr.join(' '));
#5597 (과제 안 내신 분..?)
solution1_indexOf().
const fs = require('fs');
const file = process.platform === 'linux' ? '/dev/stdin' : __dirname+'/input.txt';
const input = fs.readFileSync(file).toString().trim().split('\n').map(Number);
let arr = [];
arr.push(...input);
for(let i=1; i<=30; i++) {
if(arr.indexOf(i) < 0) {
console.log(i);
}
}
solution2_filter().
const fs = require('fs');
const file = process.platform === 'linux' ? '/dev/stdin' : __dirname+'/input.txt';
const input = fs.readFileSync(file).toString().trim().split('\n').map(Number);
let n = 30;
let arr = new Array(n).fill().map((v,i)=>i+1);
let arr2 = arr.filter((x) => !input.includes(x));
console.log(arr2.join('\n'));
### 참고한 블로그
'ALGORITHM > BOJ' 카테고리의 다른 글
[백준_javascript] 문자와 문자열(27866, 2743, 9086, 11654, 11720) (0) | 2024.08.06 |
---|---|
[백준_javascript] 1차원 배열(3052, 10811, 1546) (0) | 2024.08.05 |
[백준_javascript] 1차원 배열(10807, 10871, 10818, 2562) (0) | 2024.08.01 |
[백준_javascript] 반복문(2438, 2439, 10952, 10951) (0) | 2024.07.30 |
[백준_javascript] 반복문(25314, 15552, 11021) (0) | 2024.07.29 |