정수 삼각형 (코딩테스트 연습동적계획법(Dynamic Programming))

def solution(triangle):
    d = [[] for _ in range(len(triangle))]
    for i,item in enumerate(triangle):
        if i==0:
            d[i] = [item[0]]
        else:
            for j,num in enumerate(item):
                if j==0:
                    d[i].append(d[i-1][j] + num)
                elif j == len(item)-1:
                    d[i].append(d[i-1][j-1] + num)
                else:
                    d[i].append(max(d[i-1][j] + num,d[i-1][j-1] + num))
        
    answer = max(d[-1])
    return answer