[LeetCode 198]House Robber

最新推荐文章于 2025-08-22 19:21:44 发布

Mavs

最新推荐文章于 2025-08-22 19:21:44 发布

阅读量518

点赞数

CC 4.0 BY-SA版权

分类专栏： Leetcode Java 文章标签： leetcode DP

本文链接：https://blog.youkuaiyun.com/sbitswc/article/details/48342871

Leetcode 同时被 2 个专栏收录

287 篇文章

订阅专栏

Java

106 篇文章

订阅专栏

本文介绍了一个经典的动态规划问题——打家劫舍。在这个问题中，每栋房子都有一定数量的钱财，但相邻的房子有相连的安全系统，如果两栋相邻的房子在同一晚被抢劫，则会报警。文章提供了一种解决方案，通过动态规划的方法来确定如何选择抢劫的房子以获得最大的收益。

摘要生成于 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.

Solution:

every step result is based on previous one, could use DP.

take = nums[i] + nontake[i-1]

nontake = maxprofit

maxprofit = Math.max(take, nontake)

public int rob(int[] nums) {
        int take = 0;
        int nontake = 0;
        int maxprofit = 0;
        for(int i=0;i<nums.length;i++){
            take = nums[i] + nontake;
            nontake = maxprofit;
            maxprofit = Math.max(take, nontake);
        }
        return maxprofit;
    }