Leetcode House Robber

proudmore

于 2015-05-08 01:58:43 发布

阅读量258

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode dynamic programming leetcode

本文链接：https://blog.youkuaiyun.com/proudmore/article/details/45572597

leetcode 同时被 2 个专栏收录

146 篇文章

订阅专栏

leetcode dynamic programming

18 篇文章

订阅专栏

本文探讨了作为专业抢劫者如何在一条街道上抢劫房屋而不触发警报的最大收益策略。通过动态规划方法，文章详细解释了如何在不抢劫相邻房屋的情况下，最大化抢劫总金额。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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。。。
[code]

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