198. House Robber(动态规划)

Posted A-Little-Nut

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了198. 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.

分析
首先边界是dp[0]=nums[0],dp[1]=max(nums[0],nums[1]);对每一个house来说,只有抢与不抢两种情况,故动态转移方程dp[n]=max(dp[n-1],dp[n-2]+nums[n]).

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

空间复杂度为O(1)的

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

以上是关于198. House Robber(动态规划)的主要内容,如果未能解决你的问题,请参考以下文章

动态规划系列 Leetcode 198. House Robber

Leetcode 198 House Robber 动态规划

198.House Robber 盗窃最大值问题 | 虎哥笔记之动态规划

Leetcode之动态规划(DP)专题-198. 打家劫舍(House Robber)

leetcode 198. House Robber 打家劫舍(中等)

LeetCode 198:House Robber