House Robber(动态规划)

class Solution {
public:
    int rob(vector<int> &num) {
        if(num.empty()) return 0;
        int size=num.size();
        if(size==1) return num[0];
        vector<int> dp;
        dp.resize(size,0);
        dp[0]=num[0];
        dp[1]=(num[1]>num[0])?num[1]:num[0];
        int max_res=(dp[1]>dp[0])?dp[1]:dp[0];
        for(int i=2;i<size;++i){
            dp[i]=max(num[i]+dp[i-2],dp[i-1]);
            if(dp[i]>max_res) max_res=dp[i];
        }
        return max_res;
    }
};