Java for 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

解题思路：

dp问题 dp[i]=nums[i]+Math.max(dp[i-2], dp[i-3])

JAVA实现如下：

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

Java for LeetCode 198 House Robber

标签：

原文地址：http://www.cnblogs.com/tonyluis/p/4557726.html