算法分析与设计week15--198. House Robber

198. House Robber

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.

Analysis

这道题的本质相当于在一列数组中取出一个或多个不相邻数，使其和最大。那么我们对于这类求极值的问题首先考虑动态规划Dynamic Programming来解，我们维护一个一位数组dp，其中dp[i]表示到i位置时不相邻数能形成的最大和，那么递推公式怎么写呢，我们先拿一个简单的例子来分析一下，比如说nums为{3, 2, 1, 5}，那么我们来看我们的dp数组应该是什么样的，首先dp[1]=3没啥疑问，再看dp[2]是多少呢，由于3比2大，所以我们抢第一个房子的3，当前房子的2不抢，所以dp[2]=3，那么再来看dp[3]，由于不能抢相邻的，所以我们可以用再前面的一个的dp值加上当前的房间值，和当前房间的前面一个dp值比较，取较大值当做当前dp值，所以我们可以得到递推公式dp[i] = max(num[i] + dp[i - 2], dp[i - 1]), 由此看出我们需要初始化dp[0]和dp[1]和dp[2]，其中dp[0]即为0，dp[1]此时应该为num[0]，dp[2]此时应该为max(num[0], num[1])。

class Solution {
public:
int rob(vector<int>& nums) {
int n = nums.size();
if (n == 0) return 0;
if(n == 1) return nums[0];
if (n == 2) return max(nums[0], nums[1]);

vector<int> dp(n + 1);
dp[0] = 0;
dp[1] = nums[0];
dp[2] = max(nums[0], nums[1]);

for(int i = 3; i <= n; i++){
dp[i] = max(nums[i - 1] + dp[i - 2], dp[i - 1]);
}

return dp
;
}
};