[LeetCode] 198. House Robber Java

题目：

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.

 

题意及分析：给出一个非负的数组，从头到尾遍历，求取一个能得到最大和的序列，其中每两个元素不能相邻。使用动态规划，到当前元素i的最大收益只有两种情况：

(1)前一个元素得到最大值

(2)从前一个元素的前一个元素加上当前元素得到最大值

比较两个值，取最大值为当前点的最大收益

 

代码：

 

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