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 andit 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 tonightwithout alerting the police.

Have you met this question in a real interview?

Yes

Example

Given[3, 8, 4], return8.

Challenge

O(n) time and O(1) memory.

line 13 type should be long long int , in case of type overflow error

class Solution {

public:

/\*\*

 \* @param A: An array of non-negative integers.

 \* return: The maximum amount of money you can rob tonight

 \*/

long long houseRobber\(vector<int> A\) {

    // write your code here

    if \(A.empty\(\)\) {

        return 0;

    }

    int n = A.size\(\);

    vector<long long int> f\(n + 1, 0\);

    f\[1\] = A\[0\];

    for \(int i = 2; i <= n; ++i\) {

        f\[i\] = max\(f\[i - 2\] + A\[i - 1\], f\[i - 1\]\);

    }

    return f\[n\];

}

};