[프로그래머스] Lv3. 정수삼각형 - python

문제링크

문제풀이

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