198. House Robber
2016-03-18 21:05
204 查看
You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent houses have security system connected and it
will automatically contact the police if two adjacent houses were broken into on the same night.
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.
Credits:
Special thanks to @ifanchu for adding this problem and creating all test cases. Also thanks to @ts for
adding additional test cases.
Subscribe to see which companies asked this question
动态规划
will automatically contact the police if two adjacent houses were broken into on the same night.
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.
Credits:
Special thanks to @ifanchu for adding this problem and creating all test cases. Also thanks to @ts for
adding additional test cases.
Subscribe to see which companies asked this question
动态规划
public class Solution {//动态规划思路都是从后往前推。。。 public int rob(int[] nums) { int take = 0; int untake = 0; int max =0; for(int i=0 ;i<nums.length;i++){ take=untake+nums[i]; untake=max; max=take>untake?take:untake; } return max; } }
相关文章推荐
- 指针与引用的区别
- RAID详解
- 最长公共子序列
- 101. Symmetric Tree
- 聚类算法K-Means, K-Medoids, GMM, Spectral clustering,Ncut
- 110. Balanced Binary Tree
- 在C++中实现委托(Delegate)
- 106. Construct Binary Tree from Inorder and Postorder Traversal | Java最短代码实现
- strrev()函数会修改参数原本的值
- A*搜寻算法(A星算法)
- 【codevs 1080~1082】线段树练习重做
- 极路由的“802.1x手机号登陆wifi”插件,电脑连接wifi方法
- python-Day8
- 21. Merge Two Sorted Lists
- java编程之weblogic(12.2.1)环境下jndi与数据源(data source)的部分操作(引入weblogic.jar)
- 面试宝典
- python正则表达式
- UVA 3027 Corporative Network 带权并查集、
- 231. Power of Two
- python 分布式进程