class Solution {
public:
int rob(vector<int>& nums) {
int size = nums.size();
if(size==0)
return 0;
if(size==1)
return nums[0];
int *res = new int[size+1];
for(int i=0;i<=size;++i)
res[i] = 0;
res[1] = nums[0];
res[2] = max(nums[0],nums[1]);
for(int i=3;i<=size;++i)
res[i] = max(res[i-1],res[i-2]+nums[i-1]);
int result = res[size];
delete[] res;
return result;
}
};
198 House Robber
最新推荐文章于 2018-10-28 17:08:30 发布