leetcode213. 打家劫舍 II(java & python3)

姐姐的半熟芝士

已于 2022-04-12 17:33:09 修改

阅读量491

点赞数

分类专栏：学习做题leetcode 文章标签： java leetcode 算法 python 动态规划

于 2022-03-17 19:59:33 首次发布

本文链接：https://blog.csdn.net/qq_45908682/article/details/123559052

版权

学习做题leetcode 专栏收录该内容

341 篇文章 1 订阅

订阅专栏

打家劫舍的扩展

不过当事人表示烦很烦

java：

class Solution {
    public int rob(int[] nums) {
        int n = nums.length;
        if(n == 1)  return nums[0];
        if(n == 2)  return Math.max(nums[0], nums[1]);

        int[] dp = new int[n];
        dp[0] = nums[0];
        dp[1] = Math.max(nums[0], nums[1]);
        for(int i = 2; i < n - 1; i++){
            dp[i] = Math.max(dp[i - 2] + nums[i], dp[i - 1]);
        }

        int[] dp1 = new int[n];
        dp1[1] = nums[1];
        dp1[2] = Math.max(nums[1], nums[2]);
        for(int i = 3; i < n ; i++){
            dp1[i] = Math.max(dp1[i - 2] + nums[i], dp1[i - 1]);
        }

        return Math.max(dp[n - 2], dp1[n - 1]);
    }
}

class Solution {
    public int rob(int[] nums) {
        if(nums.length == 0){
            return 0;
        }
        if(nums.length == 1){
            return nums[0];
        }
        return Math.max(fan(Arrays.copyOfRange(nums, 0, nums.length - 1)),fan(Arrays.copyOfRange(nums, 1, nums.length)));
    }
    private int fan(int[] nums){
        int pre = 0, cur = 0, tmp;
        for(int num : nums){
            tmp = cur;
            cur = Math.max(cur, pre + num);
            pre = tmp;
        }
        return cur;
    }
}

python3:

class Solution:
    def rob(self, nums: List[int]) -> int:
        if len(nums) == 0: return 0
        if len(nums) == 1: return nums[0]

        def fan(nums):
            cur, pre = 0, 0
            for num in nums:
                cur, pre = max(cur, pre + num), cur
            return cur

        return max(fan(nums[1 :]), fan(nums[: -1]))