오늘도 코딩하나
[백준_javascript] 1차원 배열(10807, 10871, 10818, 2562) 본문
#10807 (개수 세기)
solution1_for.
const fs = require('fs');
const file = process.platform === 'linux' ? '/dev/stdin' : __dirname+'/input.txt';
const input = fs.readFileSync(file).toString().trim().split('\n');
let num = parseInt(input[0]);
let numbers = input[1].trim().split(' ').map(Number);
let findNum = parseInt(input[2]);
let arr = [];
for(let i=0; i<num; i++) {
arr.push(numbers[i]);
}
let result = arr.filter(e => e === findNum).length;
console.log(result);
solution2_forEach.
const fs = require('fs');
const file = process.platform === 'linux' ? '/dev/stdin' : __dirname+'/input.txt';
const input = fs.readFileSync(file).toString().trim().split('\n');
let num = parseInt(input[0]);
let numbers = input[1].trim().split(' ').map(Number);
let findNum = parseInt(input[2]);
let arr = [];
numbers.forEach((x)=>{
arr.push(x);
});
let result = arr.filter(e=>e === findNum).length;
console.log(result);
# 10871 (X보다 작은 수)
solution1_forEach.
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,x] = input[0].split(' ').map(Number);
let numbers = input[1].split(' ').map(Number);
let arr = [];
numbers.forEach((e)=>{
if(e < x) arr.push(e);
});
console.log(arr.join(' '));
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');
let [n,x] = input[0].split(' ').map(Number);
let numbers = input[1].split(' ').map(Number);
let result = numbers.filter(e => e < x);
console.log(result.join(' '));
# 10818 (최소, 최대)
solution1_for.
const fs = require('fs');
const file = process.platform === 'linux' ? '/dev/stdin' : __dirname+'/input.txt';
const input = fs.readFileSync(file).toString().trim().split('\n');
let num = parseInt(input[0]);
let numbers = input[1].split(' ').map(Number);
let max = numbers[0];
let min = numbers[0];
for(let i=0; i<num; i++) {
if(numbers[i]<min) {
min = numbers[i];
}
if(numbers[i]>max) {
max = numbers[i];
}
}
console.log(min, max);
solution2_sort().
const fs = require('fs');
const file = process.platform === 'linux' ? '/dev/stdin' : __dirname+'/input.txt';
const input = fs.readFileSync(file).toString().trim().split('\n');
let num = parseInt(input[0]);
let numbers = input[1].split(' ').map(Number);
numbers.sort((a,b) => (a-b));
console.log(numbers[0], numbers[num-1]);
# 2562 (최댓값)
solution1_for.
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 max = 0;
let seq = 0;
for(let i=0; i<input.length; i++) {
if(max<input[i]) {
max = input[i];
seq = i+1;
}
}
console.log(max);
console.log(seq);
solution2_Math.max.
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 max = Math.max(...input);
let seq = input.indexOf(max)+1;
console.log(max);
console.log(seq);
'ALGORITHM > BOJ' 카테고리의 다른 글
[백준_javascript] 1차원 배열(3052, 10811, 1546) (0) | 2024.08.05 |
---|---|
[백준_javascript] 1차원 배열(10810, 10813, 5597) (0) | 2024.08.01 |
[백준_javascript] 반복문(2438, 2439, 10952, 10951) (0) | 2024.07.30 |
[백준_javascript] 반복문(25314, 15552, 11021) (0) | 2024.07.29 |
[백준_javascript] 반복문(2739, 10950, 8393, 25304) (0) | 2024.07.28 |