LeetCode刷题日记（Day19）

最新推荐文章于 2020-07-23 00:03:20 发布

black rice

最新推荐文章于 2020-07-23 00:03:20 发布

阅读量289

点赞数

文章标签： LeetCode

本文链接：https://blog.csdn.net/weixin_36348299/article/details/88938211

版权

这篇博客介绍了LeetCode第198题——House Robber，要求在不触动相邻房屋警报的情况下，找到能盗取的最大金额。博主通过动态规划的方法解析了问题，给出了解题思路和代码实现，包括C++和Python版本。

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

Problem 198. 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.

Example：
```
Input: [2,7,9,3,1]
Output: 12
Explanation: Rob house 1 (money = 2), rob house 3 (money = 9) and rob house 5 (money = 1).
             Total amount you can rob = 2 + 9 + 1 = 12.
```