leetcode 198. House Robber

原创 2016年06月01日 15:26:28

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] = max(dp[i-1] , dp[i-1]+nums[i-1])) ,其中dp表示第i个房间选择之后,累计总金额。

那么现在我们在改写一下这个式子

dp[i] = max(dp[i-1], max(dp[i-2], dp[i-2]+nums[i-2])+nums[i-1])

现在我们把不允许相邻的两个数选择的条件加上, 那么nums[i-2]不能选,就设为0,上式变为

dp[i] = max(dp[i-1] , max(dp[i-2], dp[i-2]+0) +nums[i-1]);

dp[i]= max(dp[i-1] , dp[i-2]+ nmus[i-1]);

这样我们就推导出转移方程了。

代码就简单了。

/**
 * Created by kyle on 2016/6/1.
 */
public class HouseRobber {
    /******
     * 动态规划问题,每一步的状态依赖于两个决策,1,上一步是否选取,2,在上一步没选取的状态下,这一步是否选取.

     上一步没有选取 那么dp[i] = dp[i-2]+ nums[i-1];

     上一步选取了 ,这一步不能选了, dp[i] = dp[i-1];

     那么dp[i]的最优解为max(dp[i-2]+ nums[i-1], dp[i-1]);
     * @param nums
     * @return
     */
    static  public  int  houseRobber(int[] nums){
        if(nums == null || nums.length <1){
            return 0;
        }
        int[] dp = new int[nums.length+1];
        dp[0] = 0;
        dp[1] = nums[0];

        for(int i = 2; i< nums.length+1; i++){
            dp[i]= Math.max(dp[i-1], dp[i-2]+ nums[i-1]);
        }
        return  dp[nums.length];
    }
    static  public  void main(String[] a){
        int[] nums={2,4, 5 ,8,1,9,8,3,0,7,6};
        int profit = houseRobber(new int[0]);
        System.out.println("profit  is :" + profit);
    }
}


版权声明:本文为博主原创文章,未经博主允许不得转载。 举报

相关文章推荐

LeetCode#198. House Robber

You are a professional robber planning to rob houses along a street. Each house has a certain amount...

Leetcode 198. House Robber

原题链接:198. House Robber   一句话理解题意,有个偷马贼晚上要偷尽可能值钱的马,但连续两头马被偷会触发报警,问他如何在不触发报警(不偷连续的两匹马)的情况下偷到总价值最高马,返...

我是如何成为一名python大咖的?

人生苦短,都说必须python,那么我分享下我是如何从小白成为Python资深开发者的吧。2014年我大学刚毕业..

leetcode 198 & 213:House Robber

一.House Robber I 的题意是:有一排商铺,强盗不能连续抢劫相邻的两家,否则会触动报警器,求强盗在不触动报警器的前提下,可以抢劫的最多金钱总和。(输入一维数组,从中选择若干个数,使得这些数...

leetcode 198. House Robber

原文链接:http://bluereader.org/article/125400253题目You are a professional robber planning to rob houses a...

LeetCode动态规划198. House Robber思路解析

LeetCode动态规划198. House Robber思路解析,用最容易理解的递归解释

leetcode 198 House Robber

今天看了一个华为西安研究院的一个女生代码大神的总结很有感悟,下面这句话送给大家:只有好的程序员才能写出人类可以理解的代码You are a professional robber planning t...

Leetcode 198. House Robber

You are a professional robber planning to rob houses along a street. Each house has a certain amount...

Leetcode[198]-House Robber

You are a professional robber planning to rob houses along a street. Each house has a certain amount...

Leetcode_198_House Robber

本文是在学习中的总结,欢迎转载但请注明出处:http://blog.csdn.net/pistolove/article/details/47680663 You are a profes...

LeetCode - 198. House Robber

每一个house都有rob和not rob两种状态,所以我们可以使用一个[n][2]的矩阵来记录每个房子被抢和不被抢的情况下所累计的钱的数量,这道动态规划问题的四要素如下: state: f[i][...
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)