[LeetCode][JavaScript]House Robber

最新推荐文章于 2025-08-23 02:53:08 发布

转载最新推荐文章于 2025-08-23 02:53:08 发布 · 97 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/Liok3187/p/4842444.html

文章标签：

#javascript #数据结构与算法 #ViewUI

本文介绍了一个经典的动态规划问题——House Robber（房屋窃贼）。问题描述为：作为一位专业窃贼，计划抢劫沿街的房屋，但不能连续抢劫相邻的房屋以防触动报警系统。文章提供了一种使用动态规划的方法来解决这个问题，确保获得最大收益的同时避免报警。

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

https://leetcode.com/problems/house-robber/

动态规划。

分两种情况

1.偷：dp[i - 2] + nums[i - 1]

2.不偷：dp[i - 1]

dp[i] = Math.max(dp[i - 2] + nums[i - 1], dp[i - 1]);

 1 /**
 2  * @param {number[]} nums
 3  * @return {number}
 4  */
 5 var rob = function(nums) {
 6     if(nums.length === 0){
 7         return 0;
 8     }
 9     var dp = [];
10     dp[0] = 0;
11     dp[1] = nums[0];
12     for(var i = 2; i <= nums.length; i++){
13         dp[i] = Math.max(dp[i - 2] + nums[i - 1], dp[i - 1]);
14     }
15     return dp[nums.length] ;
16 };