DP2 [프로그래머스] 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. [프로그래머스] Lv3 문제풀이1(feat. JAVA) 정수 삼각형 - Dynamic Programming import java.io.*; import java.util.*; class Solution { public int solution(int[][] triangle) { int answer = 0; int[][] dp = new int[triangle.length][triangle[triangle.length-1].length]; dp[0][0] = triangle[0][0]; for(int i = 1; i < triangle.length; i++) { for(int j = 0; j < i + 1; j++) { if(j == 0) { dp[i][j] = dp[i-1][j] + triangle[i][j]; } else if (j == i) { dp[i][.. 2023. 10. 4. 이전 1 다음 728x90 반응형