LeetCode 198:House Robber
2015-12-15 20:09
489 查看
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.
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.
//题目描述:你是一名专业强盗,计划沿着一条街打家劫舍。每间房屋都储存有一定数量的金钱,唯一能阻止你打劫的约束条件就是: //由于房屋之间有安全系统相连,如果同一个晚上有两间相邻的房屋被闯入,它们就会自动联络警察,因此不可以打劫相邻的房屋。 //给定一列非负整数,代表每间房屋的金钱数,计算出在不惊动警察的前提下一晚上最多可以打劫到的金钱数。 //解题思路: //对于第i个房间我们的选择是偷和不偷, 如果决定是偷 则第i-1个房间必须不偷 那么 这一步的就是 dp[i] = nums(i-1) + dpNotTake[i -1] , 假设dp[i]表示打劫到第i间房屋时累计取得的金钱最大值. //如果是不偷, 那么上一步就无所谓是不是已经偷过, dp[i] = dp[i -1 ], 因此 dp[i] =max(dpNotTake[i-1 ] + nums(i-1), dp[i-1] ); 其中dpNotTake[i-1]=dp[i-2] //利用动态规划,状态转移方程:dp[i] = max(dp[i - 1], dp[i - 2] + num[i - 1]) //其中,dp[i]表示打劫到第i间房屋时累计取得的金钱最大值。 class Solution { public: int rob(vector<int>& nums) { int n = nums.size(); if (n == 0) return 0; int* dp = new int[n + 1]; dp[0] = 0; dp[1] = nums[0]; for (int i = 2; i < n + 1; ++i){ dp[i] = max(dp[i - 1], dp[i - 2] + nums[i - 1]); } return dp ; } };
相关文章推荐
- hiho 18 19 使用线段树进行区间查找和更新
- Hibernate的一个注释 @Transient
- Objective-C 字符串二 "可变字符串"
- 新手学习opencv二:安装详细说明
- 给jdk写注释系列之jdk1.6容器(3)-Iterator设计模式
- 擦出图片
- 杭电ACM2149(巴什博奕)
- hdoj排名
- myeclipse/eclipse修改默认的java代码风格
- redhat 更新 python 为 2.7.6
- 欧几里得求最大公约数和最小公倍数
- Java基础--环境变量、注释~
- Android加载asset的db
- Android界面组件基本用法
- Intellij IDEA安装golang插件
- NetworkManger解析 xcode7.0以上要改字段
- ios学习资料
- UI06_UIScrollView
- myeclipse中导入的jquery文件报错
- 2015年12月15日实习总结