반응형
등굣길
-
프로그래머스 - 등굣길 [자바]알고리즘 문제 풀이 2021. 2. 12. 18:45
/* * 2021-02-12 * https://programmers.co.kr/learn/courses/30/lessons/42898 */ package study.programmers.dynamic_programming; public class RoadToSchool { public int solution(int m, int n, int[][] puddles) { int[][] road = new int[m][n]; // 웅덩이 초기화 for (int[] puddle : puddles) { road[puddle[0] - 1][puddle[1] - 1] = -1; } return search(m, n, 0, 0, road); } public int search(int m, int n, int x, int..