[leedcode 198] House Robber
2015-08-03 20:46
417 查看
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.
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.
public class Solution { public int rob(int[] nums) { //注意中间变量的含义:unrob表示当前房子没有被偷。rob表示当前房子被偷了 int robbed=0; int unrobbed=0; int res=0; for(int i=0;i<nums.length;i++){ int temp=unrobbed; unrobbed=Math.max(unrobbed,robbed); robbed=nums[i]+temp; } return Math.max(unrobbed,robbed); } }
相关文章推荐
- HUD1.2.4 Nasty Hacks
- 膜拜大神
- 黑马程序员——Java基础---网络编程
- hdu1518(Square)深搜+剪枝
- DFS POJ 3087 Shuffle'm Up
- 20150803工作日志
- UISwitch
- 文件上传和下载(转)
- 黑马程序员---iOS基础---OC中的ARC、分类、block
- 实际用户ID,有效用户ID及设置用户ID
- linux 实际用户ID、有效用户ID以及保存的设置用户ID
- 南阳 oj 重建二叉树 题目756
- 离线下载的免费网站
- hdoj 1241 Oil Deposits
- java中添加了jtable组件,却显示不出来
- bootstrap组件
- SX学SX内容 笔记?
- Linux下使用curl
- 【Shader】通过Shader实现森林树木随风摆动效果
- HDU1.2.3 hide handkerchief