정수 삼각형

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

프로그래머스

 

 

def solution(triangle):
    idx = 2
    
    for i in range(1, len(triangle)) :
        for j in range(idx) :
            if j == 0 :
                triangle[i][j] += triangle[i-1][j] 
            elif j == i :
                triangle[i][j] += triangle[i-1][j-1] 
            else :
                triangle[i][j] += max(triangle[i-1][j-1], triangle[i-1][j])
        idx += 1
    
    answer = max(triangle[-1])
    
    return answer