198. House Robber*

198. House Robber*

https://leetcode.com/problems/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.

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.

C++ 实现 0

(20210610 更新) 这题的大意是小偷抢劫房子, 但不能抢劫相邻的, 求能获取的最大收益. 那么对于每所房子来说, 它有被抢和不抢两种状态, 设 dp[i] 为访问第 i 所房子时, 小偷能获得的最大收益, 那么状态转移方程就可以写成:

dp[i] = max(dp[i - 2] + nums[i], // 抢劫第 i 所房子
           dp[i - 1]  // 不抢
           )

即如果抢劫了第 i 所房子, 那么它前一所房子(第 i - 1 所房子)就不能抢, 因此收益最大为 dp[i - 2] + nums[i]; 而如果不抢第 i 所房子, 那么收益最大为访问到第 i - 1 所房子时所获得收益 dp[i - 1].

代码如下:

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

C++ 实现 1

也可以这样理解: 题中要求是不能盗窃相邻的两家, 也就是盗窃了第 0 家, 那么就不能盗窃第 1 家了, 另外, 也不一定会盗窃第二家. 设状态 f(index) 表示盗窃 [index, ... n - 1] 范围内的屋子所获得的最大财物, 那么我们要求 f(0), 状态转移方程为:

f(0) = max(v(0) + f(2), v(1) + f(3), ... 
			v(n - 3) + f(n - 1), v(n - 2), v(n - 1))

如果只盗窃第 n - 2 家的话, 那么第 n - 1 家就不能盗窃了, 所得到的财物数额就是 v(n - 2).

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