House Robber

1public int rob(int[] nums) {
2    int n = nums.length;
3    if (n == 0) return 0;
4    if (n == 1) return nums[0];
5
6    int[] dp = new int[n];
7    dp[0] = nums[0];
8    dp[1] = Math.max(nums[0], nums[1]);
9
10    for (int i = 2; i < n; i++) {
11        dp[i] = Math.max(dp[i - 1], dp[i - 2] + nums[i]);
12    }
13
14    return dp[n - 1];
15}