简单题,代码如下:
int rob(vector<int> &num) {
if(num.empty())
return 0;
int pre = 0, cur = num[0];
int result = cur;
for(int i = 1; i < num.size(); ++i){
result = max(result, pre + num[i]);
pre = cur;
cur = result;
}
return result;
}