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.

空间复杂度O(n) DP解法：

class Solution {
public:
    int rob(vector<int>& nums) {
        const int len = nums.size();
        if(len == 0) return 0;
        if(len == 1) return nums[0];
        if(len == 2) return max(nums[0],nums[1]);
        
        vector<int> Repay(len,0);
        Repay[0] = nums[0];
        Repay[1] = max(nums[0],nums[1]);
        
        for(int i=2; i < len; i++)
        {   
            //观察可知，整个循环只需要用到Repay的最近的三个数据，即可将空间复杂度O(n)降为O(1).
            Repay[i] = max(Repay[i-2]+ nums[i], Repay[i-1]);  
        }
        
        return Repay[len-1];
        
    }
};

空间复杂度O(1) DP解法：

class Solution {
public:
    int rob(vector<int>& nums) {
        const int len = nums.size();
        if(len == 0) return 0;
        if(len == 1) return nums[0];
        if(len == 2) return max(nums[0],nums[1]);
        
        int PreDate = 0,LastDate = 0,CurDate =0;
        
        for(int i=0; i < len; i++)
        {   
            //优化了保存历史数据的复杂度
            CurDate = max(PreDate+ nums[i], LastDate);  
            PreDate = LastDate;    //迭代更新最新的三个数据
            LastDate = CurDate;
        }
        
        return CurDate;
        
    }
};