Leetcode题解 198. House Robber

最新推荐文章于 2021-10-10 15:28:00 发布

原创最新推荐文章于 2021-10-10 15:28:00 发布 · 308 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode

Leetcode题解专栏收录该内容

80 篇文章

订阅专栏

本文介绍了一个经典的动态规划问题——打家劫舍。在这个问题中，你需要从一排房子里选择抢劫的目标以获得最大的收益，但不能连续抢劫相邻的两座房子。文章详细解释了如何使用动态规划的方法来解决这个问题，并给出了具体的Java实现代码。

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.

动态规划，设置maxV[i]表示到第i个房子位置，最大收益。
递推关系为max[i] = Math.max(max[i-2]+nums[i], max[i-1])

public class Solution {
    public int rob(int[] nums) {
        if(nums==null||nums.length==0){
            return 0;
        }else if(nums.length==1){
            return nums[0];
        }else if(nums.length==2){
            return nums[1]>nums[0]?nums[1]:nums[0];
        }
        int len=nums.length;
        int[] max=new int[len];
        max[1]=nums[1]>nums[0]?nums[1]:nums[0];
        max[0]=nums[0];
        for(int i=2;i<len;i++){
            max[i]=Math.max(max[i-2]+nums[i],max[i-1]);
        }
        return max[len-1];
    }
}