[프로그래머스] Lv4. 도둑질 - python

문제링크

문제풀이

def solution(money):
    n=len(money);
    dp=[[0]*n for _ in range(2)];
    dp[0][0]=money[0];
    dp[0][1]=money[0];
    dp[1][0]=0;
    dp[1][1]=money[1];
    for i in range(2):
        for j in range(2,n):
            dp[i][j]=max(dp[i][j-1],dp[i][j-2]+money[j]);
    return max(dp[0][n-2],dp[1][n-1]);