LeetCode 198. House Robber【DP+滚动数组】

最新推荐文章于 2024-01-18 14:02:27 发布

Irish_Moonshine

最新推荐文章于 2024-01-18 14:02:27 发布

阅读量308

点赞数

CC 4.0 BY-SA版权

分类专栏： Algorithm

本文链接：https://blog.youkuaiyun.com/Irish_Moonshine/article/details/78348552

Algorithm 专栏收录该内容

218 篇文章

订阅专栏

本文探讨了一个专业窃贼如何在不触动相邻房屋警报的情况下，制定最优抢劫策略以获取最大财富的问题。通过动态规划算法解决该问题，实现对每个房屋中藏匿财富的有效规划。

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.

Credits:
Special thanks to @ifanchu for adding this problem and creating all test cases. Also thanks to @ts for adding additional test cases.

题意：给你好多好多宝藏，但是你不能获得两个相邻的宝藏，求最大财富。

dp【tmp】保存到tmp这个位置所能获得的最大财富。

LL House_Robber(vector<LL>A)
{
    if (A.size() == 0)
        return 0;
    int dp[maxn];
    memset(dp, 0, sizeof(dp));
    dp[0] = A[0];
    if (A.size() > 1)
        dp[1] = max(A[0], A[1]);
    for (int i = 2; i < A.size(); i++)
    {
        dp[i] = A[i] + dp[i - 2] > dp[i - 1] ? A[i] + dp[i - 2] : dp[i - 1];
    }
    return dp[A.size() - 1];
}