[LeetCode] House Robber
来源:互联网 发布:java long 长度 编辑:程序博客网 时间:2024/06/14 00:34
House Robber
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、条件:不能同时获取相邻的金钱
2、动态规划:当前节点的金钱数量等于当前的金额加上前面的金额最大值
3、最后遍历一次求出最大值即为结果
想到一种先排序,把下标记录下来,然后从后往前遍历,将下标差不为1的相加,wrong answer ,后面才想到用动态规划,看来动态规划还是不太熟
public class Solution { public int rob(int[] nums) { if(nums.length == 2) return Math.max(nums[0], nums[1]) ; if(nums.length == 1) return nums[0] ;if(nums.length == 0) return 0 ;int[] indexs = new int[nums.length] ;for(int i = 0; i < nums.length; i ++){indexs[i] = nums[i] ;}int max = nums[0] ;for(int i = 2; i < nums.length; i ++){indexs[i] = indexs[i] + max ;max = Math.max(max, indexs[i - 1]) ;}int res = indexs[0] ;for(int i = 1; i < indexs.length; i ++){ if(indexs[i] > res) res = indexs[i] ;} return res; }}
0 0
- 【dp】Leetcode House Robber&& House Robber II
- 【leetcode】House Robber && House Robber II
- LeetCode --- House Robber & House Robber II
- LeetCode OJ House Robber
- Leetcode: House Robber
- Leetcode 198: House Robber
- House Robber - LeetCode
- LeetCode 之 House Robber
- leetcode--House Robber
- [leetcode]47 House Robber
- [LeetCode] House Robber
- LeetCode :House Robber
- [leetcode] House Robber
- [leetcode]House Robber
- [LeetCode]198.House Robber
- LeetCode House Robber题解
- leetcode:House Robber
- [LeetCode]House Robber
- java web basic knowledge
- 关于SQL语句中SUM函数返回NULL的解决办法
- Assertion failure in -[UIView layoutSublayersOfLayer:], /SourceCache/UIKit/UIKit-2935.137/UIView.m:8
- 动态规划背包问题篇
- 获取Android设备唯一标识码的几种方式详解
- [LeetCode] House Robber
- fragment中的pop显示
- C语言K&R习题系列——使用缓冲区函数接受长字符输入
- Linux虚拟文件系统
- chrome没有注册类解决
- 【codechef】Devu and binary String(字符串不超过连续k个相同,最少改几个,分类)
- 设计模式---外观模式 实例
- HTML5 canvas带渐变色的圆形进度条动画
- 丹阳在逃犯罪人员信息记录查询