/*
Runtime: 0 ms, faster than 100.00% of Java online submissions for House Robber.
Memory Usage: 34 MB, less than 100.00% of Java online submissions for House Robber.
*/
class Solution {
    public int rob(int[] nums) {
        int len = nums.length;
        if (len == 0) return 0;
        if (len == 1) return nums[0];

        int[] dp = new int[len];

        dp[0] = nums[0];
        dp[1] = nums[1];

        for (int k = 0; k <= len - 3; k++) {
            dp[k + 2] = Math.max(dp[k + 2], dp[k] + nums[k + 2]);

            if (k + 3 < len) {
                dp[k + 3] = Math.max(dp[k + 3], dp[k] + nums[k + 3]);

            }
        }

        return Math.max(dp[len - 1], dp[len - 2]);
    }
}