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);
    }
}


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

leetCode198-House Robber

链接:https://leetcode.com/problems/house-robber/ 这道理可以看做是状态压缩,每两个数字看做是一行,状态有3个,故需要F[N][3]的数组,F[i][j]就表...
  • Lu597203933
  • Lu597203933
  • 2015年04月01日 18:28
  • 7417

198. House Robber Leetcode Python

You are a professional robber planning to rob houses along a street. Each house has a certain amount...
  • hyperbolechi
  • hyperbolechi
  • 2015年03月31日 22:28
  • 1261

Leetcode_198_House Robber

本文是在学习中的总结,欢迎转载但请注明出处:http://blog.csdn.net/pistolove/article/details/47680663 You are a profes...
  • pistolove
  • pistolove
  • 2015年08月15日 12:02
  • 2143

198. House Robber [easy] (Python)

题目链接 https://leetcode.com/problems/house-robber/ 题目原文 You are a professional robber planning t...
  • coder_orz
  • coder_orz
  • 2016年06月01日 14:39
  • 1383

Leetcode:198. House Robber(JAVA)

【问题描述】 You are a professional robber planning to rob houses along a street. Each house has a ce...
  • u010183658
  • u010183658
  • 2016年03月04日 09:30
  • 257

Leetcode 198: House Robber

House Robber Total Accepted: 642 Total Submissions: 2562You are a professional robber planning to r...
  • xudli
  • xudli
  • 2015年04月01日 02:51
  • 4452

leetcode 198.House Robber-打家劫舍|动态规划

You are a professional robber planning to rob houses along a street. Each house has a certain amount...
  • happyaaaaaaaaaaa
  • happyaaaaaaaaaaa
  • 2016年03月08日 18:45
  • 597

LeetCode_198. House Robber_动态规划

198. House Robber You are a professional robber planning to rob houses along a street. Each house ...
  • Binbin_Sun
  • Binbin_Sun
  • 2016年01月21日 12:45
  • 444

leetcode 198House Robber(简单动态规划解法)

You are a professional robber planning to rob houses along a street. Each house has a certain amount...
  • lwb102063
  • lwb102063
  • 2016年11月03日 15:53
  • 188

动态规划专题之----198. House Robber

标签(空格分隔): LeetCode题目链接
  • yinchaoji_
  • yinchaoji_
  • 2017年04月13日 01:26
  • 111
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:leetcode 198. House Robber
举报原因:
原因补充:

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