[백준_javascript] 심화 1 (25083, 3003, 2444, 10988)

#25083 (새싹)

console.log(`         ,r\'\"7
r\`-_   ,'  ,\/
 \\. \". L_r\'
   \`~\\\/
      |
      |`)

 

#3003 (킹, 퀸, 룩, 비숍, 나이트, 폰)

solution1_for().

const fs = require('fs');
const file = process.platform === 'linux' ? '/dev/stdin' : __dirname+'/input.txt';

const input = fs.readFileSync(file).toString().trim().split(' ');
const piece = [1,1,2,2,2,8];
let result = [];
for(let i=0; i<piece.length; i++) {
    result.push(piece[i] - input[i]);
}

console.log(result.join(' '));

 

solution2_map().

const fs = require('fs');
const file = process.platform === 'linux' ? '/dev/stdin' : __dirname+'/input.txt';

const input = fs.readFileSync(file).toString().trim().split(' ');
const piece = [1,1,2,2,2,8];
let result = piece.map((x,i) => x-input[i])

console.log(result.join(' '));

 

#2444 (별 찍기 - 7)

solution1.

const fs = require('fs');
const file = process.platform === 'linux' ? '/dev/stdin' : __dirname+'/input.txt';

const N = fs.readFileSync(file).toString().trim();

let arr = new Array(2*N-1);
for(let i=1; i<=N; i++) {
    arr[i-1] = 2*i-1;
    arr[2*N-1-i] = 2*i-1;
}

let star = [];
arr.map((x,i) => {
    star.push(" ".repeat((2*N-1-x)/2) + "*".repeat(x))
})
console.log(star.join('\n'));

 

solution2_for().

const fs = require('fs');
const file = process.platform === 'linux' ? '/dev/stdin' : __dirname+'/input.txt';

const N = fs.readFileSync(file).toString().trim();

for(let i=1; i<N; i++) {
        let blank = ' '.repeat(N-i);
        let stars = '*'.repeat(2*i-1);
        console.log(blank+stars);
}

for(let j=N; j>0; j--) {
        let blank = ' '.repeat(N-j);
        let stars = '*'.repeat(2*j-1);
        console.log(blank+stars);
}

 

solution3_reverse().

const fs = require('fs');
const file = process.platform === 'linux' ? '/dev/stdin' : __dirname+'/input.txt';

const input = fs.readFileSync(file).toString().trim();

let star = "*".repeat(Number(input) * 2 - 1).split("");
let start = 0;
let end = Number(input) * 2 - 2;
let result1;
let result2 = [];
for (let i = 0; i < Number(input); i++) {
        result2.push(star.join(""));
	star[start] = " ";
	star[end] = "";
	start++;
	end--;
}

result1 = result2.slice().reverse().slice(0, -1);
console.log(result1.concat(result2).join("\n"));

solution4_fill().

const fs = require('fs');
const file = process.platform === 'linux' ? '/dev/stdin' : __dirname+'/input.txt';

const n = fs.readFileSync(file).toString().trim();
for(let i=0; i<n*2-1; i++) {
	let l = n*2-1;
	let p = i*2+1;
	if(l < p) p += (l-p)*2;
	let o = Array(p).fill("*").join("");
	let s = Array(n-p/2-0.5).fill(" ").join("");
	console.log(s+o)
}

 

#10988 (팰린드롬인지 확인하기)

solution1_for().

const fs = require('fs');
const file = process.platform === 'linux' ? '/dev/stdin' : __dirname+'/input.txt';

const N = fs.readFileSync(file).toString().trim().split('');

let cnt = 0;
for(let i=0; i<parseInt(N.length/2); i++) {
    if(N[i] === N[N.length-(i+1)]) {
        cnt++;
    }
}

if(cnt == parseInt(N.length/2)) {
    console.log("1");
} else {
    console.log("0");
}

 

solution2_reverse().

const fs = require('fs');
const file = process.platform === 'linux' ? '/dev/stdin' : __dirname+'/input.txt';

const N = fs.readFileSync(file).toString().trim();

console.log(N === N.split('').reverse().join('') ? 1 : 0);

 

 

 

### 참고한 블로그

https://aiday.tistory.com/114

[Javascript] 백준 2444번 문제, 별 찍기 - 7 (feat.Node.js)

https://onelight-stay.tistory.com/431

[백준][Node.js] 2444번 : 별찍기 - 7

https://blog.kimzuni.com/posts/baekjoon-2444/

별 찍기 - 7 (2444)

https://velog.io/@gate73842/%EB%B0%B1%EC%A4%80-10988%EB%B2%88node.js-%ED%8C%B0%EB%A6%B0%EB%93%9C%EB%A1%AC%EC%9D%B8%EC%A7%80-%ED%99%95%EC%9D%B8%ED%95%98%EA%B8%B0

[백준 10988번/node.js] 팰린드롬인지 확인하기