[leetcode]House Robber

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.

解题思路：思路类似求最大子数组之和， 首先对问题规模从小到大进行分析，要不要当前元素，如果包含当前元素，

则包括当前元素的最优解为max(f(i - 2) + num[i], f(i - 1)) 因为选了当前元素就不能选择邻近的元素 ， 

整体的最优解则为 max(maxValue, f(i - 2) + num[i])

class Solution {
public:
    int rob(vector<int> &num) {
        //先判断集合是否为空
        if(0 == num.size()) return 0; 
        
        int tmpOne = 0; //当前元素的前一个问题规模的最优解 即f(n - 1)
        int tmpTwo = 0; //当前元素的前两个问题规模的最优解 即f(n - 2)
        
        tmpOne = num[0]; //
        tmpTwo = 0;
        
        int maxValue = num[0];
        
        for(int i = 1; i < num.size(); i++){
            maxValue = max(num[i] + tmpTwo, maxValue); //选择当前元素的前提下的最优解即
            int tmp = tmpOne;
            tmpOne = max(num[i] + tmpTwo, tmpOne); //包括当前元素的问题规模的最优解，但不一定是整体的最优解
            tmpTwo = tmp; //问题规模整体加1，则要将原来的tmpOne 赋值给 tmpTwo
        }
        
        return maxValue;
    }
};