198. House Robber

最新推荐文章于 2025-04-13 23:45:03 发布

好多鱼哦

最新推荐文章于 2025-04-13 23:45:03 发布

阅读量193

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode

本文链接：https://blog.youkuaiyun.com/shuke1991/article/details/51820251

LeetCode 专栏收录该内容

52 篇文章

订阅专栏

本文介绍了一种使用动态规划解决的专业窃贼问题。窃贼计划沿街抢劫房屋，但相邻房屋装有相连的报警系统，因此不能连续抢劫两间房屋。通过动态规划算法求解最大收益。

摘要生成于 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.

想一想动态规划，S(n) = max(S(n-2)+a(n), S(n-1))

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