【LeetCode】House Robber I & II 解题报告

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

原创

最新推荐文章于 2024-01-18 14:02:27 发布 · 4.5k 阅读

标签

#Dynamic Programming #House Robber #LeetCode

收录于

这篇博客介绍了如何解决LeetCode上的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.