DP Level 3 정수 삼각형 - python (프로그래머스)

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