198. House Robber (DP)简答的动态规划问题Java

198. House Robber

题目

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.

Example 1:

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.

Example 2:

Input: [2,7,9,3,1]
Output: 12
Explanation: Rob house 1 (money = 2), rob house 3 (money = 9) and rob house 5 (money = 1).
             Total amount you can rob = 2 + 9 + 1 = 12.

题意

你是一个专业的强盗，你计划在一条路上抢劫房屋。每一个房屋藏着一些钱。因为相邻房屋之间有安全系统相连，这个安全系统又与警察相连，所以你不能抢劫相邻的房屋在同一个晚上。
给你一列非负整数代表每一个房屋的藏的钱数，求出在没有惊扰警察的情况下，能抢劫到的最多的钱数。

解题思路

这是一道类似于上楼梯的动态规划问题，我们很容易知道当房屋数量只有1或者2时的最优情况。因此可以用递归的思想，因为当$n>2$时，第n种情况的最优解只与第$D(n-1)$和$D(n-2)+f(n)$时的最大值有关，$f(n)$为第$n$个房的金币。终止条件就是到递归到房屋数为1或者0的时候。因此很容易写出递归代码。

Java代码

class Solution {
        public int rob(int[] nums) {
        if(nums.length == 0) return 0;
        if(nums.length == 1) return nums[0];
        int n = nums.length;
        
        int[] dp = new int[n + 1];
        dp[1] = nums[0];
        dp[2] = Math.max(nums[0], nums[1]);
        
        for(int i = 3; i <= n; i++){
            dp[i] = Math.max(nums[i - 1] + dp[i - 2], dp[i - 1]);
        }
        
        return dp[n];
    }
}