[백준_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'));

 

 

### 참고한 블로그

https://luminouswy.tistory.com/entry/%EB%B0%B1%EC%A4%80-5597%EB%B2%88-%EA%B3%BC%EC%A0%9C-%EC%95%88-%EB%82%B4%EC%8B%A0-%EB%B6%84-javascript-nodejs

# 백준 5597번 과제 안 내신 분..? (javascript, node.js)