LeetCode 198. House Robber

描述

解决

res[i] = max(res[i - 2] + nums[i], res[i - 1]);

class Solution {
public:
int rob(vector<int>& nums) {
int length = nums.size();
if (length == 0)
return 0;
else if (length == 1)
return nums[0];
else if (length == 2)
return max(nums[0], nums[1]);
vector<int> res(length);
res[0] = nums[0], res[1] = max(nums[1], nums[0]);
for (int i = 2; i < length; ++i)
{
res[i] = max(res[i - 2] + nums[i], res[i - 1]);
}
return res[length - 1];
}
};