LeetCode 198. House Robber
2016-04-21 06:37
295 查看
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.
At the first sight, this is very simple..... why not just add the even indexes and odd indexes, then compare.....
After a second thought, I found this is really stupid if I was the thief. For example: [4, 2, 3, 13, 8] --> even indexes will sum to 4+3+8 = 15. Odd indexes will sum to 2+13 = 15. But if I steal 4 + 13 = 17, I can get the maximum.
Thus, in order to steal the max, I need to consider whether the max sum of (i - 1, i -2) if sum(i-2) + num[i] > sum(i-1), I can steal i, otherwise, I will drop i to keep the value of sum(i-1).
This is DP then.... to remember the max value I passed by before.
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.
At the first sight, this is very simple..... why not just add the even indexes and odd indexes, then compare.....
After a second thought, I found this is really stupid if I was the thief. For example: [4, 2, 3, 13, 8] --> even indexes will sum to 4+3+8 = 15. Odd indexes will sum to 2+13 = 15. But if I steal 4 + 13 = 17, I can get the maximum.
Thus, in order to steal the max, I need to consider whether the max sum of (i - 1, i -2) if sum(i-2) + num[i] > sum(i-1), I can steal i, otherwise, I will drop i to keep the value of sum(i-1).
This is DP then.... to remember the max value I passed by before.
int rob(vector<int>& nums) { if(nums.size() == 0) return 0; if(nums.size() == 1) return nums[0]; if(nums.size() == 2) return max(nums[0], nums[1]); int n = nums.size(); vector<int> dp(n, 0); dp[0] = nums[0]; dp[1] = max(nums[0], nums[1]); for(int i = 2; i < n; ++i) { dp[i] = max(dp[i-2] + nums[i], dp[i-1]); } return dp[n-1]; }
相关文章推荐
- 【BZOJ 3653】 谈笑风生|主席树
- System and Device Programming------Main Memory
- <VR + Docker> 系列文章和視頻
- Bzoj3676:[Apio2014]回文串:回文自动机
- VR+Docker: 3D动漫的应用范例及其效益
- VR+Docker: 3D动漫<DOCKER化>的应用范例及其效益
- VR內容素材的標準化方法
- VR內容素材的標準化<打包>方法
- LeetCode 235. Lowest Common Ancestor of a Binary Search Tree
- LeetCode 13. Roman to Integer
- 【Unity】7.6 自定义输入
- oracle数据库安装2
- 【Unity】7.5 移动设备输入
- 【Unity】7.4 游戏外设输入
- 【Unity】7.3 键盘输入
- 【Unity】7.2 鼠标输入
- 【Unity】7.1 Input类的方法和变量
- 【Unity】第7章 输入控制
- Unbuntu下Hadoop伪分布式环境搭配
- Android学习(32) -- 网络图片下载