LeetCode.213 打家劫舍 II

原题

https://leetcode-cn.com/problems/house-robber-ii/

思路

动态规划

依托于 198.打家劫舍

由于首位房间相邻，则盗窃区间共分为两种情况

case1: [0, n-2]

case2: [1, n-1]

分别对这两种情况进行动态规划即可

动态转移方程为：dp[i]=max(dp[i−2]+nums[i],dp[i−1])

题解

package cn.codemao.botmao.admin;

/**
 * @version 1.0
 * @author: zhangkun@codemao.cn
 * @description:
 * @create: 2021-04-15 11:23
 **/
public class Code213 {

    public static void main(String[] args) {
        int[] nums = {2,3,2};
        System.out.println(rob(nums));
    }

    public static int rob(int[] nums) {
        int len = nums.length;
        if (len == 1) {
            return nums[0];
        }
        if (len == 2) {
            return Math.max(nums[0], nums[1]);
        }

//        case1: [0, n-2]
        int max1 = getMaxRob(nums, 0, len - 2);
//        case2: [1, n-1]
        int max2 = getMaxRob(nums, 1, len - 1);

        return Math.max(max1, max2);
    }

    private static int getMaxRob(int[] nums, int star, int end){
        int len = nums.length;
        int[] dp = new int[len];
        dp[star] = nums[star];
        dp[star+1] = Math.max(nums[star], nums[star+1]);
        for (int i = star+2; i <= end; i++) {
            dp[i] = Math.max(dp[i-2]+nums[i], dp[i-1]);
        }
        return dp[end];
    }

}