【LeetCode】198. House Robber

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.

Example 1:

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

 

链接：https://leetcode.com/problems/house-robber/description/

题解：动态规划，跟前面一道走楼梯一样，只不过这里走的时候是跨一个房子和跨两个房子走，所以需要三个变量来维护，比如有四个房子，则h4=max(h2,h1)+nums[4],也就是要选定一个房子需要用到后面三个，所以h1，h2来更新每个选定的房子，然后h3来维护选定房子的邻接房子，每次迭代需要对h1，h2来更新，即h1=h2，h2=h3，h3=h4

class Solution {
public:
    int rob(vector<int>& nums) {
        int h1=0,h2=0,h3=0;
        for(int i=0;i<nums.size();i++){
            int h0=max(h1,h2)+nums[i];
            h1=h2,h2=h3,h3=h0;
        }
        return max(h3,h2);
    }
};