LeetCode OJ 之 House Robber II (抢劫犯 - 二)
2015-07-27 10:18
316 查看
题目:
Note: This is an extension of House Robber.After robbing those houses on that street, the thief has found himself a new place for his thievery so that he will not get too much attention. This time, all houses at this place are arranged in a circle. That means the
first house is the neighbor of the last one. Meanwhile, the security system for these houses remain the same as for those in the previous street.
Given a list of non-negative integers representing the amount of money of each house, determine the maximum amount of money you can rob tonight without alerting the police.
在上一题的基础上房子围成了一个圆圈。求可以抢劫的最多钱数。
思路:
先参考抢劫犯(1):http://blog.csdn.net/u012243115/article/details/46340353 。数组循环意味着首尾相邻,即nums[0],nums[len-1]相邻,即如果抢劫nums[0]就不能抢劫nums[len-1],因此可以分两种情况:
1、抢劫nums[0],而不抢劫nums[len-1]
2、抢劫nums[len-1],而不抢劫nums[0]。
然后取两个结果的较大值即可。
代码:
class Solution {public:
int rob(vector<int>& nums)
{
int len = nums.size();
if(len == 0)
return 0;
//注意要单独考虑只有一个数字的情况
if(len == 1)
return nums[0];
int f0 = 0 , f1 = 0 , f2 = 0;
for(int i = 0 ; i < len-1 ; i++)
{
f2 = max(f0 + nums[i] , f1);
f0 = f1;
f1 = f2;
}
int g0 = 0 , g1 = 0 , g2 = 0;
for(int i = 1 ; i < len ; i++)
{
g2 = max(g0 + nums[i] , g1);
g0 = g1;
g1 = g2;
}
return max(f2 , g2);
}
};
相关文章推荐
- 关于Class.getResource和ClassLoader.getResource的路径问题
- Android控件开发之Dialog
- 函数绑定在Java和C++中的区别
- 《转》Ceilometer Alarm API 参数详解 及 举例说明
- 百度地图的简单使用 ——html js
- xcode6 AsynchronousTesting 异步任务测试
- CSS中不为人知Zoom属性的使用介绍(IE私有属性)
- nginx+uwsgi+django 部署原理
- WebSocket对象的“readyState”属性记录连接过程中的状态值
- 均方根值(RMS)+ 均方根误差(RMSE)+标准差(Standard Deviation)
- ABAP table control
- 成为明星软件工程师的十种特质
- nginx+uwsgi+django 部署原理
- Android控件开发之Gallery
- CSS清除浮动大全共8种方法
- 随笔
- C# 给picturebox添加滚动条
- 7月22日“.我爱你”域名市场报告:注册量达7,768个
- C语言主要做哪些方面的开发---一个来自“IT技术学习”微信群的问题及答复
- 玩转Android---UI篇---TextView(文本框)