LeetCode-198. House Robber
2017-02-27 10:57
281 查看
问题:https://leetcode.com/problems/house-robber/?tab=Description
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.
你是一个专业强盗,并计划沿街去盗窃每一个住户。每个房子都有一定量的现金,阻止你盗窃的唯一阻碍是相邻的两个房子之间有安全系统。一旦这两个房子同时被盗窃,系统就会自动联系警察。
给定一系列非负整数代表每个房子的金钱,求出再不惊动警察的情况下能盗窃到的最大值。
分析:动态规划问题。hm[i]代表当前第i房子获得的最大值,显然,hm[i]=max{hm[m-1],hm[m-2]+nums[i]}。
C++代码:
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.
你是一个专业强盗,并计划沿街去盗窃每一个住户。每个房子都有一定量的现金,阻止你盗窃的唯一阻碍是相邻的两个房子之间有安全系统。一旦这两个房子同时被盗窃,系统就会自动联系警察。
给定一系列非负整数代表每个房子的金钱,求出再不惊动警察的情况下能盗窃到的最大值。
分析:动态规划问题。hm[i]代表当前第i房子获得的最大值,显然,hm[i]=max{hm[m-1],hm[m-2]+nums[i]}。
C++代码:
class Solution { public: int rob(vector<int>& nums) { int l=nums.size(); if(l==0) return 0; else if(l==1) return nums[0]; else{ vector<int> hm(l,0); hm[0]=nums[0]; hm[1]=max(nums[0],nums[1]); for(int i=2;i<l;i++){ hm[i]=max(hm[i-1],hm[i-2]+nums[i]); } return hm[l-1]; } } };
相关文章推荐
- 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
- 198. House Robber,又发现一道数学归纳法在leetcode中的应用题
- leetcode_198. House Robber
- 【Leetcode】198. House Robber - - 【动态规划】
- Leetcode:198. House Robber(week 9)
- 【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(Python)
- Leetcode-198. House Robber,213. House Robber II
- LeetCode 198. House Robber