[leetcode]198. 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.

经典的一道动态规划问题。如何入室抢劫，使得在所抢的人家不相邻的条件下，所抢的总金额最大。

最大可选金额用F(n)表示，为了得到F(n)的递推式，我们将所有可行的选择划分为两组：包含最后一家的和不包含最后一家的，第一组中，可选的最大金

额等于c[n-1]+F(n-2)，（c为每一家的金额）即最后一家的金额加上之前n-2家的可选最大金额。另一组中，可选的最大金额等译F(n-1)，因此可以得到递推式：

F(n)=max{c[n-1]+F(n-2),F(n-1)},n>1

F(0)=0  F(1)=c[0]

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