전체 글

function solution(places) { var answer = []; for(const place of places) { var flag = false; for (var i = 0; i Array(5).fill(false)); //2 차원 배열 초기화 및 false로 채우기 외워두자 var q = []; q.push([x, y, 0]) visited[x][y] = true; while (q.length !== 0) { var data = q.shift(); var x = data[0]; var y = data[1]; var d = data[2]; if (d === 2){ continue; } else { for(var i = 0; i=0 && nx=0 && nx

function solution(record) { var answer = []; var idName = new Map(); var cmds = [] for (const reco of record) { var data = reco.split(' '); var cmd = data[0]; var id = data[1]; if (cmd !== 'Change') { cmds.push([cmd,id]); } if (data.length == 3) { idName.set(id, data[2]); } } for (const e of cmds) { if (e[0] === 'Enter'){ answer.push(`${idName.get(e[1])}님이 들어왔습니다.`); } else{ answer.push(`${idNam..

function solution(s) { var answer = 0; var minLenWord = s; var compressed = []; for (var i = 1; i

function solution(n, arr1, arr2) { var answer = []; for (var i = 0; i { if (item.length < n){ while (item.length !== n) { item = '0' + item; } } reg0 = new RegExp(/0/,'g'); reg1 = new RegExp(/1/,'g'); item = item.replace(reg0,' '); item = item.replace(reg1,'#'); return item; }); return answer; }

function solution(N, stages) { var answer = []; var result = new Map(); for (num of stages) { if (num > N) { continue; } result.set(num, result.get(num) + 1 || 1); } var count = stages.length; for (var i = 1; i { if (b[1] > a[1]) { return 1; } else if (b[1] == a[1]) { if (a[0] > b[0]) { return 1; } else{ return -1; } } else{ return -1; } })); answer = [...sortedMap.keys()]; return answer; }