版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/shey666/article/details/80849340
Leetcode 198
House Robber
- Problem Description:
偷东西:不能偷相邻房子的东西,不然会触发报警。要求在不被抓的前提下偷到东西的价值最大。
具体的题目信息:
https://leetcode.com/problems/house-robber/description/ - Example:
- Solution:
class Solution {
public:
int rob(vector<int>& nums) {
if (nums.size() == 0) return 0;
if (nums.size() == 1) return nums[0];
vector<int> t = {nums[0], max(nums[0], nums[1])};
for (int i = 2; i < nums.size(); i++) {
t.push_back(max(nums[i]+t[i-2], t[i-1]));
}
return t.back();
}
};