링크 : https://programmers.co.kr/learn/courses/30/lessons/42897 def dp(visited, money, n): answer = 0 for i in range(n, len(money)): visited[i] = max(visited[i-1], visited[i-2]+money[i]) #첫번째 집 간 경우, 마지막 집도 갔다면 빼주어야함 if visited[0] != 0 : if visited[-1] == visited[-2]: return visited[-1] else: return visited[-2] else: return visited[-1] def solution(money): answer = 0 visited = [0 for x in range(le..