[LeetCode]198 强盗入屋

House Robber(强盗入屋)

【难度：Easy】
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.
给定一个整数数组表示一系列连续的屋子里面放有的金钱，在不能连续进入相邻屋子抢钱的情况下求能抢到的最大金额。

---

解题思路

动态规划问题，要考虑要是在当前点i抢钱的话，加上前面在点i-2的所抢到的金额之和是否比在i-1抢到的钱要多，是则当前点的最大金额变为dp[i] = dp[[i-2]+n[i]，否则变为dp[i] = dp[i-1]。

---

c++代码如下：

class Solution {
public:
    int rob(vector<int>& nums) {
        if (nums.empty())
            return 0;
        int n = nums.size();
        int rob[n];
        rob[0] = nums[0];
        rob[1] = nums[1]>nums[0]?nums[1]:nums[0];
        for (int i = 2; i < n; i++) {
            rob[i] = (rob[i-2]+nums[i])>rob[i-1] ?(rob[i-2]+nums[i]):rob[i-1];
        }
        return rob[n-1];
    }
};