198. House Robber
来源:互联网 发布:汉诺塔递归算法图解 编辑:程序博客网 时间:2024/06/06 07:06
题目
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.
Credits:
Special thanks to @ifanchu for adding this problem and creating all test cases. Also thanks to @ts for adding additional test cases.
题意
不能取数组中相邻的数,求能取到的最大值
分析
dp[i]表示从0到i最多能取多少, 对每个位置上的数,有取和不取两种选择,
如果取,说明前一个数不能取,这种情况下的值为
如果不取, 前一个数可取可不取,直接使用
状态转移方程:
代码
class Solution {public: int rob(vector<int>& nums) { int n = nums.size(); if (n <= 0) return 0; if (n == 1) return nums[0]; vector<int> dp(n, 0); dp[0] = nums[0]; dp[1] = nums[1] > nums[0]?nums[1]:nums[0]; for (int i = 2; i < nums.size(); i++) { dp[i] = max(dp[i-1], dp[i-2]+nums[i]); } return dp[n-1]; }};
- 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
- Lucene的简单使用
- 欢迎使用CSDN-markdown编辑器
- Unity 发布webgl 网页自适应
- Android 7.1 GUI系统-vsync信号的产生和接收(五)
- Shingling算法-简单说
- 198. House Robber
- Android Studio升级遇到的问题记录
- MySQL练习
- 模拟memcpy和memmove函数,以及他们的区别。。
- 几款移动跨平台App开发框架比较
- 自上而下,逐步求精的方法
- NB连网过程简介
- 566. Reshape the Matrix。
- TCP/IP协议族体系结构以及主要协议(下)