오늘도 코딩하나
[백준_javascript] 반복문(2438, 2439, 10952, 10951) 본문
#2438 (별 찍기 - 1)
const fs = require('fs');
const file = process.platform === 'linux' ? '/dev/stdin' : __dirname+'/input.txt';
const input = fs.readFileSync(file).toString().trim();
let num = parseInt(input);
let star = "";
for(let i=0; i<num; i++) {
star += "*"
console.log(star);
}
#2439 (별 찍기 - 2)
solution1_for문 2개.
const fs = require('fs');
const file = process.platform === 'linux' ? '/dev/stdin' : __dirname+'/input.txt';
const input = fs.readFileSync(file).toString().trim();
let num = parseInt(input);
let star = "";
for(let i=0; i<num; i++) {
star = '';
for(let j=0; j<num-1-i; j++) {
star += " "
}
for(let m=0; m<=i; m++) {
star += "*"
}
console.log(star);
}
solution2_for문 1개.
const fs = require('fs');
const file = process.platform === 'linux' ? '/dev/stdin' : __dirname+'/input.txt';
const input = fs.readFileSync(file).toString().trim();
let num = parseInt(input);
let star = "";
let blank = "";
for(let i=1; i<=num; i++) {
star += "*";
for(let j=0; j<num-i; j++) {
blank += " ";
}
console.log(blank + star);
blank = "";
}
solution3_array.
const fs = require('fs');
const file = process.platform === 'linux' ? '/dev/stdin' : __dirname+'/input.txt';
const input = fs.readFileSync(file).toString().trim();
let num = parseInt(input);
let star = new Array(num).fill(' ');
for (let i=num-1; i>=0; i--) {
star[i] = "*";
console.log(star.join(''));
}
solution4_repeat().
const fs = require('fs');
const file = process.platform === 'linux' ? '/dev/stdin' : __dirname+'/input.txt';
const input = fs.readFileSync(file).toString().trim();
let num = parseInt(input);
let result = '';
for(let i=1; i<=num; i++) {
result += ' '.repeat(num-i) + '*'.repeat(i) + '\n';
}
console.log(result);
#10952 (A+B - 5)
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');
for(let i=0; i<input.length; i++) {
let [a,b] = input[i].split(' ').map(Number);
if(a+b > 0) {
console.log(a+b);
} else {
break;
}
}
solution2_while.
const fs = require('fs');
const file = process.platform === 'linux' ? '/dev/stdin' : __dirname+'/input.txt';
const input = fs.readFileSync(file).toString().trim().split('\n');
let i = 0;
while(i<input.length) {
let [a,b] = input[i].split(' ').map(Number);
if(a+b > 0) {
console.log(a+b);
} else {
break;
}
i++;
}
#10951 (A+B - 4)
const fs = require('fs');
const file = process.platform === 'linux' ? '/dev/stdin' : __dirname+'/input.txt';
const input = fs.readFileSync(file).toString().trim().split('\n');
let i = 0;
while(i<input.length) {
let [a,b] = input[i].split(' ').map(Number);
console.log(a+b);
i++;
}
### 참고한 블로그
https://laycoder.tistory.com/167
https://mywebproject.tistory.com/201
'ALGORITHM > BOJ' 카테고리의 다른 글
[백준_javascript] 1차원 배열(10810, 10813, 5597) (0) | 2024.08.01 |
---|---|
[백준_javascript] 1차원 배열(10807, 10871, 10818, 2562) (0) | 2024.08.01 |
[백준_javascript] 반복문(25314, 15552, 11021) (0) | 2024.07.29 |
[백준_javascript] 반복문(2739, 10950, 8393, 25304) (0) | 2024.07.28 |
[백준_javascript] 조건문(2884, 2525, 2480) (0) | 2024.07.27 |