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

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];}