백준

[BEAKJOON / node.js] 16120 PPAP

https://www.acmicpc.net/problem/16120 // test.txt 'PPAPPAP' sol1 let P = require('fs').readFileSync('test.txt').toString().trim().split(''); function solution(P) { let stack = []; for(let i=0;i= 4) { if(stack[stack.length-1] === 'P') { if(stack.slice(-4).join('') === 'PPAP') { stack.splice(-4); stack.push('P'); } } } } return stack.length === 1 && stack[stack.length-1] === 'P' ? 'PPAP' : 'NP' } ..

[BEAKJOON / node.js] 11509 풍선 맞추기

https://www.acmicpc.net/problem/11509 // test.txt 5 4 5 2 1 4 sol1 - 시간 초과❌ let [N,...input] = require('fs').readFileSync('test.txt').toString().trim().split('\n'); function solution(N,input) { let arr = input[0].split(' ').map(Number); let answer = 0; while(Math.max(...arr) !== 0) { let top = Math.max(...arr); let topIndex = arr.indexOf(top); for(let i=topIndex+1;i0); let answer = 0; for(let i ..

[BEAKJOON / node.js] 1946 신입 사원

https://www.acmicpc.net/problem/1946 // test.txt 3 5 3 2 1 4 4 1 2 3 5 5 7 3 6 7 3 4 2 1 4 5 7 2 5 6 1 5 1 5 2 4 3 3 4 2 5 1 sol1 - ❌ const [T,...input] = require('fs').readFileSync('test.txt').toString().trim().split('\n'); for(let i=0;iv.split(' ').map(Number)).sort((a,b) => a[0]-b[0]); let answer = 1; for(let i=1;i

[BEAKJOON / node.js] 1475 방 번호

https://www.acmicpc.net/problem/1475 //test.txt 12696 sol1 let input = require('fs').readFileSync('test.txt').toString().trim(); function solution(input) { let arr = Array.from({length:10},()=>0); for(let i=0;i

[BEAKJOON / node.js] 17298 오큰수

https://www.acmicpc.net/problem/17298 //test.txt 4 3 5 2 7 sol1 - 시간 초과❌ let [N,...input] = require('fs').readFileSync('test.txt').toString().trim().split('\n'); let arr = input[0].split(' ').map(Number) let answer = []; for(let i=0;i

[BEAKJOON / node.js] 1302 베스트셀러

https://www.acmicpc.net/problem/1302 //test.txt 9 table chair table table lamp door lamp table chair sol1 let [N,...input] = require('fs').readFileSync('test.txt').toString().trim().split('\n'); let map = new Map(); let answer = input.reduce((acc,cur) => { let best = (map.get(cur)||0) +1; let max = (map.get(acc)||0); map.set(cur,best); if(best>max) acc=cur; else if(best === max) cur { let best =..

[BEAKJOON / node.js] 1744 수 묶기

https://www.acmicpc.net/problem/1744 //test.txt 4 -1 2 1 3 sol1 let [_,...input] = require('fs').readFileSync('test.txt').toString().trim().split('\n'); let arr = input.map(Number); function solution(arr) { let plusArr = arr.filter(el => el>0).sort((a,b) => b-a); let minusArr = arr.filter(el => el a-b); let plusLen = plusArr.length; let minusLen = minusArr.length; let plusAns = ifCase(plusArr,pl..

[BEAKJOON / node.js] 12904 A와 B

https://www.acmicpc.net/problem/12904 //test.txt B ABBA sol1 - ❌ let [S,T] = require('fs').readFileSync('test.txt').toString().trim().split('\n'); let arr = S.split(''); function solution(arr,T) { while(T.length !== arr.length) { arr.push('A'); if(T.length === arr.length) break; arr.reverse().push('B'); arr.push("A"); } return arr.join('') === T ? 1 : 0 }; console.log(solution(arr,T)); //1 S에 문제..