leetcode 198. House Robber
2017-05-18 18:36
344 查看
难度:easy
这虽然是道easy题,但是仍旧让我卡了很久,其实就是选择奇偶性。
代码如下
int rob(vector<int>& nums) {
if(nums.size()==0)
return 0;
else if(nums.size()==1)
return nums[0];
int a=0,b=0;
for(int i=0;i<nums.size();i++)
{
if(i%2==0)
{
a=max(a+nums[i],b);
}
else
{
b=max(a,b+nums[i]);
}
}
return max(a,b);
}
这虽然是道easy题,但是仍旧让我卡了很久,其实就是选择奇偶性。
代码如下
int rob(vector<int>& nums) {
if(nums.size()==0)
return 0;
else if(nums.size()==1)
return nums[0];
int a=0,b=0;
for(int i=0;i<nums.size();i++)
{
if(i%2==0)
{
a=max(a+nums[i],b);
}
else
{
b=max(a,b+nums[i]);
}
}
return max(a,b);
}
相关文章推荐
- Leetcode-198. House Robber,213. House Robber II
- LeetCode 198. House Robber
- 算法17: leetcode 198. House Robber
- [LeetCode] 198. House Robber 打家劫舍
- Leetcode 198. House Robber
- LeetCode:198. House Robber
- 【LeetCode】198. House Robber
- LeetCode 198. House Robber
- LeetCode--198. House Robber(打家劫舍)Python
- LeetCode-198. House Robber (JAVA)寻找数组不相邻组合最大值DP
- 【LeetCode题解】198. House Robber
- LeetCode 198. House Robber
- LeetCode 198. House Robber - 贪心算法
- leetcode198. House Robber
- [leetcode] 198. House Robber
- 【LeetCode】 198. House Robber
- leetcode 198. House Robber 入室抢劫 + DP动态规划求解
- [LeetCode]198. House Robber I&II
- LeetCode 198. House Robber
- leetcode 198. House Robber