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 systems connected and it will automatically contact the police if two adjacent houses were broken into on the same night.

Given an integer array nums representing the amount of money of each house, return the maximum amount of money you can rob tonight without alerting the police.

Example 1:

Input: nums = [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: nums = [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.

Constraints:

• 1 <= nums.length <= 100
• 0 <= nums[i] <= 400

思路：

经典dp题目，dp[i]表示到当前index i为止，总共能够获得的最大金币数。转移公式为dp[i] = max(dp[i - 1], dp[i - 2] + home[i])，意思也比较好理解，如果不偷这家，那么状态就是从上一家继承过来的，即dp[i - 1]；否则就是偷这家，那就是从上上家继承过来并且加上这一家可以获得的金币，即dp[i - 2] + home[i]。初始化部分，因为index 为0时只能偷第0家，所以dp[0]为home[0]，而dp[1]的话应该是从0和1两家之中挑更多的偷。

代码：

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