213 - House Robber II

最新推荐文章于 2020-03-31 22:43:06 发布

绿水兰田

最新推荐文章于 2020-03-31 22:43:06 发布

阅读量114

点赞数 1

分类专栏： leetcode 文章标签： leetcode 算法

本文链接：https://blog.csdn.net/LvShuiLanTian/article/details/96131666

版权

leetcode 专栏收录该内容

83 篇文章 1 订阅

订阅专栏

Problem

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.

Code

public class Solution {
    
    public int rob(int[] nums) {
        int len = nums.length;
        if (len == 0) {
            return 0;
        }
        if (len == 1) {
            return nums[0];
        }
        int ret = nums[0];
        int tmp = nums[0];
        nums[0] = 0;
        ret = this.max(ret, this.solve(nums));
        nums[0] = tmp;
        nums[len - 1] = 0;
        ret = this.max(ret, this.solve(nums));
        return ret;
    }
    
    private int solve(int[] nums) {
        int len = nums.length;
        int[] dp = new int[len];
        dp[0] = nums[0];
        dp[1] = this.max(nums[0], nums[1]);
        for (int i = 2; i < len; ++i) {
            dp[i] = this.max(dp[i - 1], dp[i - 2] + nums[i]);
        }
        return dp[len - 1];
    }
    
    private int max(int a, int b) {
        return a > b ? a : b;
    }
    
}