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.

分析

DP问题，best0表示没有rob当前house的最大值，best1表示rob了当前house的最大值，由于不允许rob两个相邻的house，所以best0可以等于rob上个house或者没有rob上个house的最大值，而best1只能等于没有rob上个house+当前house之和，故上一次循环的best0需要保存下来。

class Solution {
public:
    int rob(vector<int>& nums) {
        int best0 = 0;   // 表示没有rob当前houses  
        int best1 = 0;   // 表示rob了当前houses  
        for(int i = 0; i < nums.size(); i++){  
            int temp = best0;//temp一开始等于上次没rob的最大值  
            best0 = max(best0, best1); // 没有rob当前houses，那么它等于上次rob了和没rob的最大值  
            best1 = temp + nums[i]; // rob了当前houses，值只能等于上次没rob的+当前houses的money  
        }  
        return max(best0, best1); 
    }
};