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

1、动态规划这两道简单的题都把我搞的不行了。

2、参考了两个人的博客，这应该不算原创了吧？但也不能算转载吧？还是弄成转载好了，自己的东西太少。

状态压缩和动态规划：点击打开链接

两种动态规划：点击打开链接

class Solution {
public:
    int rob(vector<int> &num) {
        int temp;
        int r=0;
        int nr=0;
        int len=num.size();
        for(int i=0;i<len;++i)
        {
            temp=nr;
            nr=max(nr,r);
            r=temp+num[i];
        }
        return max(nr,r);
    }
};