【leetcode】198. House Robber

题目：
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.

---

思路：
学习了一下https://www.cnblogs.com/lightwindy/p/8648410.html，思路就是动态规划。数组元素dp[i]的意思时到第i个house为止可以抢劫的最大金额。动态规划的三个公式如下：

• i==0时，dp[0]=nums[0]；
• i==1时，dp[1]=max(nums[0], nums[1])；
• i>=2时，dp[i] = max(nums[i]+dp[i-2], dp[i-1])。
  理解dp数组：如果i个house未被抢劫，则dp[i]就等于dp[i-1]。

---

代码实现：

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

---

参考：
https://www.cnblogs.com/lightwindy/p/8648410.html