class Solution {
public:
int rob(vector<int>& nums) {
vector<int> dp;
int n = nums.size();
dp.push_back(0);
int ans = 0;
for(int i=0;i<n;i++)
{
int temp = 0;
if(i==0) temp = nums[i];
for(int j=0;j<i;j++)
{
temp = max(dp[j]+nums[i],temp);
}
dp.push_back(temp);
ans = max(ans,temp);
}
return ans;
}
};
LeetCode 198. House Robber
最新推荐文章于 2022-03-05 22:30:26 发布