[프로그래머스] 정수삼각형

https://school.programmers.co.kr/learn/courses/30/lessons/43105

 

Solution

class Solution {
    int[][] memo;

    public int solution(int[][] triangle) {
        int len = triangle.length;
        memo = new int[len][len];

        for(int i=0; i<triangle[len-1].length; i++) {
            memo[len-1][i] = triangle[len-1][i];
        }

        for(int i= triangle.length-2; i>=0; i--) {
            for(int j=0; j<triangle[i].length; j++) {
                memo[i][j] = triangle[i][j] += Math.max(memo[i+1][j], memo[i+1][j+1]);
            }
        }

        return memo[0][0];
    }
}