[LeetCode]--198. House Robber

最新推荐文章于 2024-10-13 15:10:00 发布

杜鲁门

最新推荐文章于 2024-10-13 15:10:00 发布

阅读量760

点赞数

分类专栏： LeetCode LeetCode算法分析文章标签： leetcode HouseRob 动态规划算法偷到最多金钱算法算法

本文链接：https://blog.csdn.net/bug_moving/article/details/52764328

版权

LeetCode算法分析同时被 2 个专栏收录

115 篇文章 1 订阅 ¥9.90 ¥99.00

订阅专栏

LeetCode

126 篇文章 0 订阅

订阅专栏

这篇博客探讨了LeetCode中的198题——House Robber，这是一个关于动态规划的算法问题。博主介绍了如何通过动态规划策略，计算在不触发警报的情况下能偷窃到的最多金额。博客提到了两种动态规划解决方案，并提到还存在一种状态压缩的方法，但博主表示尚未研究。

摘要由CSDN通过智能技术生成

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.

Credits:
Special thanks to @ifanchu for adding this problem and creating all test cases. Also thanks to @ts for adding additional test cases.

我想到了动态规划的问题。这题可以看做是简单的DP问题，用A[0]表示没有rob当前house的最大money，A[1]表示rob了当前house的最大money，那么A[

了解本专栏