[LeetCode]198. House Robber

最新推荐文章于 2025-04-13 23:45:03 发布

narcssusinnook

最新推荐文章于 2025-04-13 23:45:03 发布

阅读量376

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode 文章标签： leetcode

本文链接：https://blog.youkuaiyun.com/u012468264/article/details/50708918

LeetCode 专栏收录该内容

76 篇文章

订阅专栏

本文针对LeetCode上的房屋抢劫问题，采用动态规划的方法进行解答。该问题是：作为一位专业的小偷，计划抢劫一条街上的房屋，但相邻房屋的安全系统相连，若同晚抢劫相邻两户则会报警。因此，给定每个房屋藏有的金钱数额，如何计算最大可得金额而不触动警报。

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

Problem Description

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.
[https://leetcode.com/problems/house-robber/]

思路

动态规划！！在第i个房子面前要考虑rob和不rob得到的金钱总量。因为没有负数，所以尽多的rob吧！！哈哈哈！！！！

Code

package Q198;

public class Solution {

    public static int rob(int[] nums) {
        int rob = 0;
        int notrob=0;
        for(int i=0;i<nums.length;i++){
            int tmp=notrob;
            notrob=Math.max(rob, notrob);
            rob=tmp+nums[i];

        }
        return Math.max(rob, notrob);
    }

//  public static void main(String[] args) {
//      int[] a = {  1};
//      System.out.print(rob(a));
//  }

}