LeetCode | 213. House Robber II

最新推荐文章于 2024-10-11 05:06:51 发布

1LOVESJohnny

最新推荐文章于 2024-10-11 05:06:51 发布

阅读量179

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/iLOVEJohnny/article/details/110407401

版权

leetcode C++

LeetCode 专栏收录该内容

285 篇文章 0 订阅

订阅专栏

题目：

You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed. All houses at this place are arranged in a circle. That means the first house is the neighbor of the last one. Meanwhile, adjacent houses have a 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 nums representing the amount of money of each house, return the maximum amount of money you can rob tonight without alerting the police.

Example 1:

Input: nums = [2,3,2]
Output: 3
Explanation: You cannot rob house 1 (money = 2) and then rob house 3 (money = 2), because they are adjacent houses.

Example 2:

Input: nums = [1,2,3,1]
Output: 4
Explanation: Rob house 1 (money = 1) and then rob house 3 (money = 3).
Total amount you can rob = 1 + 3 = 4.

Example 3:

Input: nums = [0]
Output: 0

Constraints:

1 <= nums.length <= 100
0 <= nums[i] <= 1000

代码：

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

        return max(max(dp[nums.size()-1], dp[nums.size()-2]), max(dp1[nums.size()], dp1[nums.size()-1]));
    }
};

转眼，十一月就过去了~ 这个月有些进展，开发了两个月的初版工作算是迎来了第一个节点。接下来还有路继续要走，继续前行，慢慢来~ 加油~

再见，十一月；你好，十二月~