House Robber:在不取相邻元素的情况下对数组求和

You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent houses have security system connected and it will automatically contact the police if two adjacent houses were broken into on the same night.

Given a list of non-negative integers representing the amount of money of each house, determine the maximum amount of money you can rob tonight without alerting the police.

测试样例包括：[183,219,57,193,94,233,202,154,65,240,97,234,100,249,186,66,90,238,168,128,177,235,50,81,185,165,217,207,88,80,112

思路一:递归穷举

即分两种情况：取当前值、不取当前值，然后取二者中最大者作为结果。

时间超时。

 public int rob(int[] nums) {
        if(nums.length==0) return 0;
        if(nums.length==1) return nums[0];
        if(nums.length==2) return Math.max(nums[0],nums[1]);
        int[] n1 = new int[nums.length-1];
        int[] n2 = new int[nums.length-2];
        //n1[0] = nums[0];
        //n2[0] = nums[1];
        for(int i = 0;i<nums.length-1;i++){
            n1[i] = nums[i+1];
        }
        for(int i = 0;i<nums.length-2;i++){
            n2[i] = nums[i+2];
        }
        return Math.max(rob(n1),rob(n2)+nums[0]);
    }

思路二：动态规划

参考递归，第i步最优与前i-1步与前i-2步有关。

d[i]=Math.max{d[i-1],d[i-2]+a[i]}

 public int rob(int[] nums) {
        if(nums.length==0) return 0;
        if(nums.length==1) return nums[0];
        if(nums.length==2) return Math.max(nums[0],nums[1]);
        int[] d = new int[nums.length+1];
        d[0] = 0;
        d[1] = nums[0];
        d[2] =  Math.max(nums[0],nums[1]);
        for(int i=3;i<=nums.length;i++){
            d[i] = Math.max(d[i-1],d[i-2]+nums[i-1]);//第三个元素，所以需要下标为2
        }
        return d[nums.length];
    }

可以简化：因为d[i-1]、d[i-2]仅为中间变量，其中的prevNo相当于d[i-1],prevYes相当于 d[i-2]+nums[i-1]

public int rob(int[] num) {
    int prevNo = 0;
    int prevYes = 0;
    for (int n : num) {
        int temp = prevNo;
        prevNo = Math.max(prevNo, prevYes);
        prevYes = n + temp;
    }
    return Math.max(prevNo, prevYes);
}

神思路：Leetcode  https://leetcode.com/problems/house-robber/discuss/

#define max(a, b) ((a)>(b)?(a):(b))
int rob(int num[], int n) {
    int a = 0;
    int b = 0;
    
    for (int i=0; i<n; i++)
    {
        if (i%2==0)
        {
            a = max(a+num[i], b);
        }
        else
        {
            b = max(a, b+num[i]);
        }
    }
    
    return max(a, b);
}

参考文章：