LeetCode 198. House Robber
2017-06-25 22:02
357 查看
题意
房屋强盗,给出一串非负整数代表各个房屋的金钱,求出今晚可以抢劫到的最大数额金钱。要求不能惊动警察,惊动的条件是抢劫了相邻房屋。题解
题目意思可以转化成给出 一个非负整数的数组,求出里面不相邻的多个整数,使得整数的和最大。可列出状态转移方程:
dp[i] = max(dp[i-2]+nums[i],dp[i-1]);
即:第i个房屋的最大数是:抢劫i房屋加上抢劫i-2房屋累积金额,与抢劫i-1累积的金额
class Solution { public: int rob(vector<int>& 4000 nums) { if(nums.empty()) return 0; vector<int> dp(nums.size(),0); for(int i = 0;i < nums.size();i ++){ //状态转移方程 if(i == 0) dp[i] = nums[i]; if(i == 1) dp[i] = max(nums[0],nums[1]); if(i >= 2) dp[i] = max(dp[i-2]+nums[i],dp[i-1]); } return dp[nums.size()-1]; } };
相关文章推荐
- [LeetCode]problem 198. House Robber
- LeetCode 198. House Robber
- LeetCode 198. House Robber
- Leetcode:198. House Robber(JAVA)
- LeetCode 198. House Robber(小偷游戏)
- leetcode 198. House Robber
- [leetcode] 198. House Robber
- 198. House Robber LeetCode
- Leetcode 198. House Robber (Easy) (cpp)
- [Leetcode] 198. House Robber 解题报告
- LeetCode 198. House Robber
- 2017.12.18 LeetCode - 198. House Robber【dp入门】
- LeetCode198. House Robber
- leetCode 198. House Robber | 动态规划
- leetcode 198. House Robber
- leetcode_198. House Robber 抢劫不相邻的房子,使得抢到的金钱数目最大, 动态规划
- leetcode 198. House Robber
- leetcode 198. House Robber
- [leetcode] 198. House Robber 解题报告
- 【Leetcode】198. House Robber - - 【动态规划】