프로그래머스 : 수식최대화 JAVA
import java.util.*; class Solution { static String[][] combinations = {{"+","-","*"},{"+","*","-"},{"-","+","*"},{"-","*","+"},{"*","+","-"},{"*","-","+"}}; public long solution(String expression) { String split[] = expression.split("(?
프로그래머스: 위클리코드 3주차 (퍼즐조각 채우기)
const dy = [1,-1,0,0]; const dx = [0,0,1,-1]; const Mapping = (list) => { let minY = Number.MAX_VALUE; let minX = Number.MAX_VALUE; for(let arr of list) { minY = Math.min(minY, arr[0]); minX = Math.min(minX, arr[1]); } return list.map((arr)=> [arr[0]-minY,arr[1]-minX]); }; const BFS = (visit, table, y, x, N, stand) => { const q = []; const list = []; q.push([y,x]); visit[y][x] = true; while(q.le..
