kakasoo

// 프로그래머스 레벨 2 [카카오 인턴] 수식 최대화 const getPriority = () => { const operator = ["+", "-", "*"]; const priority = []; let visited; let answer; const dfs = (start) => { visited[start] = true; answer.push(operator[start]); if (answer.length === 3) { priority.push([...answer]); } for (let i = 0; i < operator.length; i++) { if (!visited[i]) { visited[i] = true; dfs(i); visited[i] = false; answer.pop(); ..

const checkDoll = (stack, curCount) => { stack.some((el, i) => { if(stack[i] === stack[i+1]) { stack.pop(); stack.pop(); curCount += 2; } }) return curCount; } const solution = (board, moves) => { let answer = 0; let stack = []; moves.map((el) => { board.some((row, height) => { if(row[el -1] != 0) { stack.push(row[el -1]); answer = checkDoll(stack, answer); row[el -1] = 0; return true; } }); });..