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.

思路： 用d[i][0] 表示不选择第i个房子当前的最大money,用d[i][1]表示选择第i个房子当前的最大money,那么d[i+1][0]=max{d[i][0],d[i][1]} 

d[i+1][1]=d[i][0]+nums[i]  因为相邻的两个房子不能同时选择，那么如果选择了当前房子，那么它的前一个房子是不能被选中的。这里只需要用两个变量来保存当前最大的money,不用采用二维数组。

遍历数组，保存并更新每一次选择rob当前房子的最大money  best0，和不选择rob当前房子的最大money  best1，如果不选择当前房子，当前的best0就更新为上一次保存的best0和best1中比较大的一个，如果选择了当前房子，由于相邻的两个房子不能同时选择，那么当前的best1就只能表示为上一次的best0+nums[i],遍历完数组之后返回best0和best1中比较大的一个。

public class Solution {
    public int rob(int[] nums) {
        int length=nums.length;
        if(length==0) return 0;
        int best0=0;
        int best1=0;
        for(int i=0;i<length;i++)
        {
            int temp=best0;
            best0=Math.max(best0,best1);
            best1=temp+nums[i];
        }
        return Math.max(best0,best1);
    }
}