# [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.

# 解题思路

f[i]表示进入第i+1个房间时所得到的最大财富。

# 实现代码1

```//Runtime:2ms class Solution { public: int rob(vector<int>& nums) { int len = nums.size(); if (len == 0) return 0; if (len == 1) return nums[0]; if (len == 2) return max(nums[0], nums[1]); int prepre = nums[0]; int pre = max(nums[0], nums[1]); int cur; for (int i = 2; i < len; i++) { cur = max(pre, prepre + nums[i]); prepre = pre; pre = cur; } return cur; } };```

# 实现代码2

```# Runtime:76ms class Solution: # @param {integer[]} nums # @return {integer} def rob(self, nums): size = len(nums) if size == 0: return 0 elif size == 1: return nums[0] elif size == 2: return max(nums[0], nums[1]) prepre = nums[0] pre = max(nums[0], nums[1]) for i in range(2, size): cur = max(pre, prepre + nums[i]) prepre = pre pre = cur ```

` return cur`

1. 本站所有资源来源于用户上传和网络，如有侵权请邮件联系站长！
2. 分享目的仅供大家学习和交流，您必须在下载后24小时内删除！
3. 不得使用于非法商业用途，不得违反国家法律。否则后果自负！
4. 本站提供的源码、模板、插件等等其他资源，都不包含技术服务请大家谅解！
5. 如有链接无法下载、失效或广告，请联系管理员处理！
6. 本站资源售价只是赞助，收取费用仅维持本站的日常运营所需！
7. 如遇到加密压缩包，请使用WINRAR解压,如遇到无法解压的请联系管理员！