[프로그래머스] 땅따먹기

 

def solution(land):
    d=[[0]*4 for _ in range(len(land))]

    for i in range(4):
        d[0][i]=land[0][i]

    for i in range(1, len(land)):
        for j in range(4):
            if j == 0:
                d[i][j]=land[i][j]+max(d[i-1][1],d[i-1][2],d[i-1][3])
            elif j == 1:
                d[i][j]=land[i][j]+max(d[i-1][0],d[i-1][2],d[i-1][3])
            elif j == 2:
                d[i][j]=land[i][j]+max(d[i-1][0],d[i-1][1],d[i-1][3])
            elif j == 3:
                d[i][j]=land[i][j]+max(d[i-1][0],d[i-1][1],d[i-1][2])

    return max(d[len(land)-1])