[Programmers] 정수 삼각형

https://school.programmers.co.kr/learn/courses/30/lessons/43105?language=java

프로그래머스

 

1. Python

def solution(triangle):
    ret = 0
    m = len(triangle)
    for i in range(1, m):
        for j in range(len(triangle[i])):
            left = triangle[i-1][j-1] if j != 0 else 0
            right = triangle[i-1][j] if j != len(triangle[i]) - 1 else 0
            triangle[i][j] = max(left, right) + triangle[i][j]
            ret = max(ret, triangle[i][j])
    return ret

 

2. C++

int solution(vector<vector<int>> triangle) {
    int ret = 0;
	int m = triangle.size();
	for (int i=1; i<m; i++) {
		for (int j=0; j<triangle[i].size(); j++) {
			int left = j != 0 ? triangle[i-1][j-1] : 0;
			int right = j != triangle[i].size() - 1 ? triangle[i-1][j] : 0;
			triangle[i][j] = max(left, right) + triangle[i][j];
			ret = max(ret, triangle[i][j]);
		}
	}
    return ret;
}

 

3. Java

import static java.lang.Math.max;

class Solution {
    public int solution(int[][] triangle) {
        int ret = 0;
        int m = triangle.length;
        for (int i=0; i<m; i++) {
            for (int j=0; j<triangle[i].length; j++) {
                int left = j != 0 ? triangle[i-1][j-1] : 0;
                int right = j != triangle[i].length - 1 ? triangle[i-1][j] : 0;
                triangle[i][j] = max(left, right) + triangle[i][j];
                ret = max(ret, triangle[i][j]);
            }
        }
        return ret;
    }
}