ARTS第六周

最新推荐文章于 2024-12-08 16:36:01 发布

留得住时间留不住你

最新推荐文章于 2024-12-08 16:36:01 发布

阅读量119

点赞数

分类专栏： ARTS

本文链接：https://blog.youkuaiyun.com/qq_39513105/article/details/89851999

版权

ARTS 专栏收录该内容

7 篇文章

订阅专栏

Algorithm

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.

怪我脑子愚笨，这么简单也找错思路

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