Cacher is the code snippet organizer for pro developers

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

public class Solution {
    public int rob(int[] nums) {
        if (nums == null || nums.length < 1) return 0;
        if (nums.length == 1) return nums[0];
        int n = nums.length;
        //int[] dp = new int[n + 1];
        //dp[1] = nums[0];
        int first = nums[0];
        int second = Math.max(nums[0], nums[1]);
        for (int i = 2; i < n; i++) {
            int val = Math.max(first + nums[i], second);
            first = second;
            second = val;
        }
        return second;
    }
}