【LeetCode】【JAVA】【074】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.

Follow up:

If this function is called many times, how would you optimize it?

思路：

Recursion--Timeout. 

第 i 个位置的 max 值是由 max(i-2, i-3) 加上 i 位置的值决定，以此类推 

Code：

    public int rob(int[] num) {
        int len = num.length;
        int i=3;
        if(len > 2) num[2]+=num[0];
        while(i<num.length){
            num[i] += Math.max(num[i-2],num[i-3]);
            i++;
        }
        if(len <= 0) return 0;
        else if(len == 1) return num[0];
        else return Math.max(num[len-1],num[len-2]);
    }

备注：

ArrayList 只有 .get(index) 方法，没有 .next