House Robber II——Leetcode
2015-09-20 16:44
260 查看
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.
题目大意:所有的住户围成一圈,只能隔着抢劫,问可以抢到的总额最大是多少。
解题思路:
因为第一家和最后一家是连着的,所以抢第一家就不能抢最后一家,抢最后一家就不能抢第一家,那么可以把数组分成两段,0~n-1和1~n两段,分别计算最大的,取较大的。
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.
题目大意:所有的住户围成一圈,只能隔着抢劫,问可以抢到的总额最大是多少。
解题思路:
因为第一家和最后一家是连着的,所以抢第一家就不能抢最后一家,抢最后一家就不能抢第一家,那么可以把数组分成两段,0~n-1和1~n两段,分别计算最大的,取较大的。
public int rob(int[] nums) { if(nums==null||nums.length==0){ return 0; } if(nums.length==1){ return nums[0]; } if(nums.length==2){ return Math.max(nums[0],nums[1]); } int res = -1; int[] max = new int[nums.length+1]; max[0]=nums[0]; max[1]=Math.max(nums[0],nums[1]); for(int i=2;i<nums.length-1;i++){ max[i]=Math.max(max[i-1],max[i-2]+nums[i]); } res=Math.max(res,max[nums.length-2]); Arrays.fill(max,0); max[1]=nums[1]; max[2]=Math.max(nums[1],nums[2]); for(int i=3;i<nums.length;i++){ max[i]=Math.max(max[i-1],max[i-2]+nums[i]); } res=Math.max(res,max[nums.length-1]); return res; }
相关文章推荐
- 怎样设置MyEclipse显示代码行数以及设置字体
- YouTube推荐系统
- MapReduce案例学习(9) 将全体员工按照总收入(工资+提成)从高到低排列,要求列出姓名及其总收入
- Spring实现AOP的4种方式
- bzoj1455
- Linux下opennms编译
- BBEdit 10.X for mac的lincese
- Android 寻找xutils上传图片失败办法的路径
- 指针作为函数的返回值
- Perfect Squares
- Vijos 1121 马拦过河卒
- 1.1Linux 系统简介(学习过程)
- linux常用命令(42):ping 命令
- C++中接口与抽象类
- js之节点属性
- 软件工程之宏观把握
- 【小知识点总结】去掉ScrollVIew拉到尽头时再拉的阴影效果
- Argument-Dependent Lookup (aka ADL, or “Koenig Lookup”)
- UVa1225——Digit Counting
- 杭电acm--2031