LeetCode213. House Robber II——动态规划-Toy模板网

这篇具有很好参考价值的文章主要介绍了LeetCode213. House Robber II——动态规划。希望对大家有所帮助。如果存在错误或未考虑完全的地方，请大家不吝赐教，您也可以点击"举报违法"按钮提交疑问。

一、题目

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 an integer array 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 = [1,2,3]
Output: 3

Constraints:

1 <= nums.length <= 100
0 <= nums[i] <= 1000文章来源地址https://www.toymoban.com/news/detail-828361.html

二、题解

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