House Robber

原创 2015年07月09日 16:07:34

1 题目描述

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.

题目出处:https://leetcode.com/problems/house-robber/


2 解题思路

本题属于动态规划的题,主要是找到动态规划的方程。方法可以参考http://www.cnblogs.com/ganganloveu/p/4417485.html


3 源代码

package com.larry.easy;

public class HouseRobber {
	public int rob(int[] nums) {
		//max表示第i个房的最大收益
		int len = nums.length;
		int max[] = new int[len];
		
		if(len == 0) return 0;
		else if(len == 1) return nums[0];
		else{
			max[0] = nums[0];
			if(nums[0] >= nums[1]) max[1] = nums[0];
			else max[1] = nums[1];
			for(int i = 2; i < len; i++)
				max[i] = Math.max(max[i-2] + nums[i], max[i-1]);
		}
        return max[len-1];
    }
}


337. House Robber III

The thief has found himself a new place for his thievery again. There is only one entrance to this a...

House Robber III

c++/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *l...

<LeetCode OJ> (198 / 213) House Robber(I / II)

House Robber My Submissions Question Total Accepted: 45702 Total Submissions: 142460 Difficulty:...

LeetCode-难题集之House_Robber系列

记——House_Robber,这个系列的题的思路也很简单,不过大神的代码就是给力,因此记下留着以后学习参考。 House_Robber class Solution { public: ...
  • ww2041
  • ww2041
  • 2016年07月26日 10:25
  • 97

LeetCode 337. House Robber III

大概题意:给定一棵二叉树,每个节点都有一个值,要求从其中选取若干个节点,是的值的和最大,约束条件为任意两个选取的节点之间不能相连。           解题的思路也很清晰,我们可以用动态规划的做法,...
  • isNoel
  • isNoel
  • 2016年12月22日 18:49
  • 167

leetcode 337:House Robber III

leetcode 337:House Robber III。leetcode新题,递归的动态规划

DP (9) -- Maximal Square, Maximal Rectangle,House Robber II

Maximal Square, Maximal Rectangle, House Robber II
  • dwt0317
  • dwt0317
  • 2017年01月12日 16:34
  • 60

LeetCode 198 House Robber

假设是一个小偷(这比喻,,,),在这条街上有一排房子,每一个房子都有一个确定的价值,相邻的房子不能连续偷窃,问,偷了这条街后,最大偷窃的价值总和是多少? 利用DP思想,对于从第4个房子开始,有两种选择...

LeetCode House Robber题解

House_Robber 题目如下所示 You are a professional robber planning to rob houses along a street. Each house...
  • qisong3
  • qisong3
  • 2015年04月10日 10:38
  • 288

DP (1) -- Range Sum Query - Immutable, House Robber, Climbing Stairs

Range Sum Query - Immutable,House Robber
  • dwt0317
  • dwt0317
  • 2017年01月04日 20:27
  • 104
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:House Robber
举报原因:
原因补充:

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