198. House Robber

https://leetcode.com/problems/house-robber/description/

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.

解题思路：
对于dp[i]有rob和unrob两种情况
状态转移方程

if rob    rob[i]=unrob[i-1]+nums[i]
if unrob  unrob[i]=max(rob[i-1],unrob[i-1])

边界

      rob[0] = nums[0]
      unrob[0] = 0

public class House_Robber_198 {

    /**
     * 对于dp[i]有rob和unrob两种情况
     * if rob    rob[i]=unrob[i-1]+nums[i]
     * if unrob  unrob[i]=max(rob[i-1],unrob[i-1])
     * 边界 
     * rob[0] = nums[0]
     * unrob[0] = 0;
     * @param nums
     * @return
     */
    public int rob(int[] nums) {
        if(nums==null||nums.length==0){
            return 0;
        }
        int n = nums.length;
        int[] rob = new int[n+1];
        int[] unrob = new int[n+1];
        rob[0] = nums[0];
        unrob[0] = 0;
        for(int i=1;i<n;i++){
            rob[i] = unrob[i-1]+nums[i];
            unrob[i] = Math.max(rob[i-1], unrob[i-1]);
        }
        return Math.max(rob[n-1], unrob[n-1]);
    }

    public static void main(String[] args) {
        new House_Robber_198().rob(new int[]{});
    }

}