leetcode House Robber

最新推荐文章于 2018-04-16 12:16:12 发布

xclfafa

最新推荐文章于 2018-04-16 12:16:12 发布

阅读量176

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/xclfafa/article/details/78388233

版权

LeetCode 专栏收录该内容

51 篇文章 0 订阅

订阅专栏

题目：

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，类似于01背包问题，考虑当前房间抢不抢劫，当不抢劫，dp[i] = dp[i-1] ,当抢劫的话，dp[i] = dp[i-2] + nums[i],比较两者较大的为dp[i];

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

题目：

213. House Robber II

Note: This is an extension of House Robber.

After robbing those houses on that street, the thief has found himself a new place for his thievery so that he will not get too much attention. This time, all houses at this place are arranged in a circle. That means the first house is the neighbor of the last one. Meanwhile, the security system for these houses remain the same as for those in the previous street.

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[n-2]和dp2[n-4] + nums[n-2]的大小即可，dp表示的是最后一个房间不抢的情况，dp2表示最后一个房间抢劫的情况，要除掉第一个和最后两个房间，中间的和上面一样。没优化。

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