力扣 --- 打家劫舍

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 systems connected and it will automatically contact the police if two adjacent houses were broken into on the same night.

Given an integer array nums representing the amount of money of each house, return the maximum amount of money you can rob tonight without alerting the police.

Example 1:

Input: nums = [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: nums = [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.

Constraints:

1 <= nums.length <= 100
0 <= nums[i] <= 400
相关标签
数组
动态规划

思路：要求不能相邻，假设劫匪在位置i，那么劫匪获得的最大利益只能是0~i-2中最大的利益，那么代码为：

#include <bits/stdc++.h>
using namespace std;
class Solution {
public:
    int rob(vector<int>& nums) {
        int  ans = 0;
        int len = nums.size();
        if(len<2){
            return nums[len-1];
        }
        int dp[len];
        memset(dp, 0, sizeof(dp));
        dp[0] = nums[0];
        dp[1] = nums[1];
        ans = max(dp[0], dp[1]);
        for(int i=2; i<len; i++){
            dp[i] = dp[i-2]+nums[i];
            for(int j=0; j<=i-2; j++){
                dp[i] = max(dp[i], dp[j]+nums[i]);
            }
            ans = max(ans, dp[i]);
        }
        return ans;
    }
};