Greedy1 [프로그래머스] Lv3 문제풀이3(feat. JAVA) 등굣길 - Dynamic Programming class Solution { public long[][] dp; public int solution(int m, int n, int[][] puddles) { int answer = 0; dp = new long[n+1][m+1]; dp[1][1] = 1; for(int[] a : puddles) dp[a[1]][a[0]] = -1; for(int i = 1; i o1.end - o2.end); ArrayList result = new ArrayList(); int last = -30_001; for(int i = 0; i last) { last = route.. 2023. 10. 6. 이전 1 다음 728x90 반응형