House Robber

public class Solution {
    public int rob(int[] nums) {
        if (nums == null || nums.length == 0) {
            return 0;
        }
        // int[] maxValue = new int[nums.length+1];
        // maxValue[1] = nums[0];
        // for (int i = 2; i <= nums.length; i++) {
        //     maxValue[i] = Math.max(maxValue[i - 2] + nums[i - 1], maxValue[i - 1]);
        // }
        int p0 = 0, p1 = nums[0], max = nums[0];
        for (int i = 2; i <= nums.length; i++) {
            max = Math.max(p0 + nums[i - 1], p1);
            p0 = p1;
            p1 = max;
        }
        
        return max;
    }
}