leetcode【198】【tag DP】House Robber【c++版本，动态规划，时间空间O（n）均100%】

本文链接：https://blog.csdn.net/fanyuwgy/article/details/106189181

本文探讨了一种算法问题，即如何在不触动相邻房屋警报系统的情况下，从一系列房屋中选择抢劫目标以获得最大收益。通过动态规划方法，我们找到了求解这一问题的有效途径，并优化了算法的空间复杂度。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

问题描述：

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.

源码：

题目比较难懂，我先说一下意思，就是选一些值，让他们的和最大并且不能相邻。

用一个dp[i]表示前i个元素满足题意得最大值。递归方程如下：

dp[i] = max(result, dp[i-2]+nums[i])

时间复杂度O（n），空间O（n）。

时间空间都为100%

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

最后想了一下，其实可以不需要O（n），因为每次只需要用dp[i-2]和result的值，用两个变量存下来就行了。