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.

分析：

小偷遍历所有房子，经过第i家有两种做法：偷或不偷，分别计算两种状态之后的最大收获，更新当前最大收获。

定义数组rob[n][2]，记rob[i][0]为不偷第i家，rob[i][1]为偷第i家

若偷第i家，则第i-1家不能偷，故偷第i家之后的最大收获为rob[i-1][0] + nums[i]

若不偷第i家，则第i-1家可以偷，也可以不偷，故不偷第i家之后的最大收获为经过（偷或不偷）第i-1家之后的最大值max( rob[i-1][0], rob[i-1][1] )

由于每一步只依赖上一步的状态，故可以交替使用两个数组以减少空间复杂度

代码： 复杂度：空间：O(1)，时间：O(n)

int rob(vector<int>& nums) {
    int n = nums.size();
    if( n == 0 )    return 0;
    
    vector<vector<int>> res(2, vector<int>(2,0));
    int rob = 0, maxrob = 0;
    
    for( int i = 0; i < n; ++i )
    {
        res[rob][0] = max( res[rob^1][1], res[rob^1][0] );
        res[rob][1] = res[rob^1][0] + nums[i];
        maxrob = max( res[rob][0], res[rob][1] );
        rob ^= 1;
    }
    return maxrob;
}