开始刷leetcode day3： house robber

所有昵称都被用了呢

于 2015-05-04 03:11:23 发布

阅读量230

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode

本文链接：https://blog.youkuaiyun.com/a33b33C33/article/details/45470899

leetcode 专栏收录该内容

88 篇文章

订阅专栏

本文介绍了一种使用动态规划解决打家劫舍问题的方法，该问题要求在不触动相邻房屋警报的情况下，计算出从一系列房屋中能窃取到的最大金额。

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.

Java：

public class Solution {
public int rob(int[] nums) {
if(nums.length <= 1)
return nums.length == 0? 0: nums[0];

int[] best = new int[nums.length];
best[0] = nums[0];
best[1] = Math.max(nums[1],nums[0]);

for(int i=2; i< nums.length; i++)
{
best[i] = Math.max(best[i-2] + nums[i], best[i-1]);
}
return best[nums.length - 1];
}
}