House Robber

最新推荐文章于 2021-08-05 11:16:28 发布

原创最新推荐文章于 2021-08-05 11:16:28 发布 · 187 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode之旅同时被 2 个专栏收录

65 篇文章

订阅专栏

c++

29 篇文章

订阅专栏

探讨一个专业窃贼如何在不触动相邻房屋警报的情况下，通过动态规划算法实现利益最大化的问题。文章介绍了一个C++实现的具体算法，该算法能够找出在给定条件下能获得的最大金额。

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

动态规划问题：

到第i个房子的最大收益为：maxValue[i] = max(maxValue[i-2]+nums[i],maxValue[i-1]);

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