ALGORITHM/BOJ
[백준_javascript] 문자와 문자열(10809, 2675, 1152)
오늘도 코딩하나
2024. 8. 7. 13:35
#10809 (알파벳 찾기)
const fs = require('fs');
const file = process.platform === 'linux' ? '/dev/stdin' : __dirname+'/input.txt';
const input = fs.readFileSync(file).toString().trim().split('').map(x=>x.charCodeAt());
const arr = new Array(26).fill().map((x,y) => y+97);
const result = arr.map(x => input.indexOf(x));
console.log(result.join(' '));
# 2675 (문자열 반복)
solution1_for().
const fs = require('fs');
const file = process.platform === 'linux' ? '/dev/stdin' : __dirname+'/input.txt';
const [T, ...input] = fs.readFileSync(file).toString().trim().split('\n');
let P = '';
input.forEach(x => {
P = '';
let [R,S] = x.trim().split(' ');
S.split('').map(y=>{
for(let i=0; i<R; i++) {
P += y;
}
});
console.log(P);
});
solution2_repeat().
const fs = require('fs');
const file = process.platform === 'linux' ? '/dev/stdin' : __dirname+'/input.txt';
const [T, ...input] = fs.readFileSync(file).toString().trim().split('\n');
input.forEach(x => {
let [R,S] = x.trim().split(' ');
let P = S.split('').map(y => y.repeat(R) );
console.log(P.join(''));
});
# 1152 (단어의 개수)
※ 틀렸습니다.
const fs = require('fs');
const file = process.platform === 'linux' ? '/dev/stdin' : __dirname+'/input.txt';
const input = fs.readFileSync(file).toString().trim().split(' ');
console.log(input.length);
▶ 공백을 입력한 경우, input = ['']로 input.length가 1로 출력된다.
solution1_조건.
const fs = require('fs');
const file = process.platform === 'linux' ? '/dev/stdin' : __dirname+'/input.txt';
const input = fs.readFileSync(file).toString().trim().split(' ');
console.log(input.includes('') ? 0 : input.length);
solution2_filter().
const fs = require('fs');
const file = process.platform === 'linux' ? '/dev/stdin' : __dirname+'/input.txt';
const input = fs.readFileSync(file).toString().trim().split(' ');
const result = input.filter(x => x !== '')
console.log(result.length);
### 참고한 블로그
https://mywebproject.tistory.com/467
https://mywebproject.tistory.com/469
https://leeseong010.tistory.com/m/13