#leetcode#HouseRobber

最新推荐文章于 2025-04-14 23:34:52 发布

原创最新推荐文章于 2025-04-14 23:34:52 发布 · 460 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode

LeetCode 同时被 2 个专栏收录

92 篇文章

订阅专栏

面试准备

24 篇文章

订阅专栏

本文探讨了一个专业抢劫者如何在不触发相邻房屋警报系统的情况下，最大化其夜间抢劫收益的问题。通过使用一维动态规划算法，解决了一个经典的计算机科学问题，即在给定一系列非负整数（代表每间房屋的金钱数量）的情况下，找到一个不包含相邻元素之和的最大序列。代码示例展示了如何实现这一算法，并解释了动态规划在解决此类问题中的应用。

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

House Robber

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

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

运行结果是Line 8: error: cannot access JsonArray

应该是leetcode抽风了？用Eclipse运行并无问题