Leetcode Note: House Robber

Leetcode Note: House Robber

I. Description

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.

Ii. Question Analysis

Dynamic Planning, set maxV [I] to represent the position of the I house, the maximum benefit.

The recursive relationship is maxV [I] = max (maxV [I-2] + num [I], maxV [I-1])

Note: there may be questions about the above recursive relationship, is there the possibility that maxV [I-1] does not include num [I-1]?

In this case, maxV [I-1] is equivalent to maxV [I-2], so the former is larger.

Iii. Sample Code

class Solution {public:    int rob(vector
  
    &num) {        int n = num.size();        if(n == 0)            return 0;        else if(n == 1)            return num[0];        else        {            vector
   
     maxV(n, 0);            maxV[0] = num[0];            maxV[1] = max(num[0], num[1]);            for(int i = 2; i < n; i ++)                maxV[i] = max(maxV[i-2]+num[i], maxV[i-1]);            return maxV[n-1];        }    }};