题目描述:
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.
你是一个专业的小偷,计划偷窃沿街的房屋。每间房内都藏有一定的现金,影响你偷窃的唯一制约因素就是相邻的房屋装有相互连通的防盗系统,如果两间相邻的房屋在同一晚上被小偷闯入,系统会自动报警。
给定一个代表每个房屋存放金额的非负整数数组,计算你在不触动警报装置的情况下,能够偷窃到的最高金额。
Example 1:
Input: [1,2,3,1]
Output: 4
Explanation: Rob house 1 (money = 1) and then rob house 3 (money = 3).
Total amount you can rob = 1 + 3 = 4.
Example 2:
Input: [2,7,9,3,1]
Output: 12
Explanation: Rob house 1 (money = 2), rob house 3 (money = 9) and rob house 5 (money = 1).
Total amount you can rob = 2 + 9 + 1 = 12.
示例 1:
输入: [1,2,3,1]
输出: 4
解释: 偷窃 1 号房屋 (金额 = 1) ,然后偷窃 3 号房屋 (金额 = 3)。
偷窃到的最高金额 = 1 + 3 = 4 。
示例 2:
输入: [2,7,9,3,1]
输出: 12
解释: 偷窃 1 号房屋 (金额 = 2), 偷窃 3 号房屋 (金额 = 9),接着偷窃 5 号房屋 (金额 = 1)。
偷窃到的最高金额 = 2 + 9 + 1 = 12 。
解题思路:
这个题应该用动态规划来解。
设一个 max_robValue数组,用来记录当盗窃到第i号房间时能够获得的最高总金额。根据题意,盗窃第i号房间时能够获得的最高总金额,等于当前房间的金额,加上盗窃0到i-2号房间能够获得的最高总金额。最后,数组的倒数第二个元素和最后一个元素中最大的那一个,即为所求。
实现(C++):
class Solution {
public:
int rob(vector<int>& nums) {
if(nums.size()==0) //如果nums数组为空
return 0;
if(nums.size()==1) //如果nums数组只有1个元素
return nums[0];
if(nums.size()==2) //如果nums数组只有2个元素
return max(nums[0], nums[1]);
int max_robValue[nums.size()]; //max_robValue数组用来记录当抢劫到第i号房间时,能够获得的最高总金额
max_robValue[0]=nums[0];
max_robValue[1]=nums[1];
for(int i=2; i<nums.size(); i++)
max_robValue[i]=nums[i]+*max_element(max_robValue, max_robValue+i-1);
return max_robValue[nums.size()-2]>max_robValue[nums.size()-1]?max_robValue[nums.size()-2]:max_robValue[nums.size()-1];
}
};