198. House Robber
来源:互联网 发布:威海孙小乔淘宝店 编辑:程序博客网 时间:2024/06/05 11:43
题意: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.
思路:简单的DP问题,找到对应的递推式就好了,我开始的想法是r[i] = max(r[i-2],r[i-3])+nums[i],这样的问题是其实是把递推式复杂化了一点,需要更远的值来递推求解,就需要更多的数据空间,所以我声明了一个数组,还在前面加了三个0来方便初始化,具体见代码:
class Solution {public: int rob(vector<int>& nums) { int m = nums.size(); vector<int> result (m+3, 0); for(int i=3;i<m+3;i++){ result[i] = max(result[i-2],result[i-3])+nums[i-3]; } return max(result[m+1],result[m+2]); }};
其实最简单的递推式应该是:
这样就只需要常数额外空间就可以求解了:
class Solution: def rob(self, nums): last, now = 0, 0 for i in nums: last, now = now, max(last + i, now) return now
- 337. House Robber III+198. House Robber
- 198. House Robber&&213. House Robber II
- 198. House Robber && 213. House Robber II
- [LeetCode]198.House Robber
- 【LeetCode】198. House Robber
- 【LeetCode】198.House Robber
- LeetCode 198. House Robber
- 198.House Robber
- [leetcode] 198.House Robber
- [leetcode] 198. House Robber
- LeetCode:198. House Robber
- 198. House Robber LeetCode
- 198. House Robber
- [LeetCode]198. House Robber
- 198. House Robber
- LeetCode || 198. House Robber
- 198. House Robber
- LeetCode-198. House Robber
- H7N9禽流感——正确应对,不必惊慌
- instance “error” 了怎么办?- 每天5分钟玩转 OpenStack(159)
- Codeforces Round #402 (Div. 2) A. Pupils Redistribution
- Ubuntu server 16.04 修改 root 密码
- 动态规划-钢条切割
- 198. House Robber
- Questions when Install OpenNMS
- WEB后端学习(三)——Zend Studio中的快捷键
- java框架--Spring入门
- 【zabbix教程九】——zabbix3.0 批量添加端口监控
- 缩略词汇整理
- postgresql中如何新增加一个SysCache
- Integer.decode()和Intger.valueof()
- seaJS模块化开发