House Robber

最新推荐文章于 2024-10-01 23:05:47 发布

ColorlessSilver

最新推荐文章于 2024-10-01 23:05:47 发布

阅读量290

点赞数

分类专栏： leetcode 文章标签：算法

本文链接：https://blog.csdn.net/ColorlessSilver/article/details/45537861

版权

leetcode 专栏收录该内容

12 篇文章 0 订阅

订阅专栏

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.

思路：一道动态规划题，大意是求一列数中不相邻的几个数和最大，那么其实就是当前数加上到前前个数或者前前前个数的和最大，然后和到前一个数的最大值作比较取最大，转化成状态转移方程就是

dp[i] = max { max(dp[i-2],dp[i-3])+nums[i] , dp[i-1] }

代码：

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