class Solution {
public:
int rob(vector<int>& nums) {
int arr[2]={};
int i(0);
bool f(0);
for(;i!=nums.size();++i,f=!f)
{
arr[f]=max(arr[f]+nums[i],arr[!f]);
}
return arr[!f];
}
};
leetcode - 198. House Robber
最新推荐文章于 2022-03-08 22:40:25 发布