코드
def solution(land) :
for h in range(1, len(land)) :
for w in range(4) :
prev_layer = land[h-1]
land[h][w] += max(prev_layer[:w] + prev_layer[w+1:])
return max(land[-1])
def solution(land) :
for h in range(1, len(land)) :
for w in range(4) :
prev_layer = land[h-1]
land[h][w] += max(prev_layer[:w] + prev_layer[w+1:])
return max(land[-1])