Programmers 정수 삼각형

Answer

import java.util.*;

class Solution {
    
    public int solution(int[][] triangle) {
        int length = triangle.length;
        
        for (int i = 1; i < length; i++) {
            triangle[i][0] += triangle[i-1][0];
            triangle[i][i] += triangle[i-1][i-1];
            
            for (int j = 1; j < i; j++){
                triangle[i][j] += Math.max(triangle[i-1][j-1], triangle[i-1][j]);
            }
        }

        return Arrays.stream(triangle[length-1]).max().getAsInt();
    }
    
}