[leetcode-198]House Robber(java)

最新推荐文章于 2024-01-18 14:02:27 发布

zdavb

最新推荐文章于 2024-01-18 14:02:27 发布

阅读量475

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode

本文链接：https://blog.youkuaiyun.com/zdavb/article/details/48036715

leetcode 专栏收录该内容

243 篇文章

订阅专栏

本文通过动态规划算法解决相邻房屋抢劫问题，探讨如何在不触发警报的情况下最大化抢劫金额。

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

分析：这道题是典型的动态规划算法，将大问题分解为小问题是解决问题的很好方法。当我们对第n家计算时，val[j]=max(val[j-2]+nums[j],val[j-1])
代码如下：276ms

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

        int[] tmpNums = new int[length];
        tmpNums[0] = nums[0];
        for(int i = 1;i<length;i++){
             int val = nums[i];
             if(i>1){
                 val+=tmpNums[i-2];
             }
             tmpNums[i] = Math.max(tmpNums[i-1],val);
        }
        return tmpNums[length-1];
    }
}