zoukankan      html  css  js  c++  java
  • 213. 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 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.

    Example 1:

    Input: [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: [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.

    Approach #1: DP + Memory. [C++]

    class Solution {
    public:
        int rob(vector<int>& nums) {
            int len = nums.size();
            if (len == 0) return 0;
            if (len == 1) return nums[0];
            
            vector<int> memo1(len+1, -1);
            vector<int> memo2(len+1, -1);
            int ans1 = rob(nums, 0, len-2, memo1);
            int ans2 = rob(nums, 1, len-1, memo2);
            
            return max(ans1, ans2);
        }
        
    private:
        int rob(const vector<int>& nums, const int start, int idx, vector<int>& memo) {
            if (idx < start) return 0;
            if (memo[idx] >= 0) return memo[idx];
            int result = max(rob(nums, start, idx-2, memo)+nums[idx], 
                             rob(nums, start, idx-1, memo));
            memo[idx] = result;
            return result;
        }
    };
    

      

    Analysis:

    Since House[1] and House[n] are adjacent, they cannot be robbed together. Therefore, the problem becomes to rob either House[1]-House[n-1] or House[2]-House[n], depending on which choice offers more money. Now the problem has degenerated to the House Robber, which is already been solved.

    永远渴望,大智若愚(stay hungry, stay foolish)
  • 相关阅读:
    Web大前端面试题-Day12
    Web大前端面试题-Day11
    每天刷Web面试题(前10天汇总)
    Web大前端面试题-Day10
    Web大前端面试题-Day9
    Web大前端面试题-Day8
    Web大前端面试题-Day5
    Web大前端面试题-Day7
    Web大前端面试题-Day6
    php获取时间是星期几
  • 原文地址:https://www.cnblogs.com/h-hkai/p/10385724.html
Copyright © 2011-2022 走看看