leetcode 198. House Robber
来源:互联网 发布:如何用微博做淘宝客 编辑:程序博客网 时间:2024/05/29 18:14
原文链接:http://bluereader.org/article/125400253
题目
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.
解
public class Solution { //解题思路://对于第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间房屋时累计取得的金钱最大值。 public int rob(int[] nums) { int n = nums.length; 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] = Math.max(dp[i - 1], dp[i - 2] + nums[i - 1]); } return dp[n]; }}
0 0
- [LeetCode]198.House Robber
- 【LeetCode】198. House Robber
- 【LeetCode】198.House Robber
- LeetCode 198. House Robber
- [leetcode] 198.House Robber
- [leetcode] 198. House Robber
- LeetCode:198. House Robber
- 198. House Robber LeetCode
- [LeetCode]198. House Robber
- LeetCode || 198. House Robber
- LeetCode-198. House Robber
- [LeetCode]198. House Robber
- 【LeetCode】198. House Robber
- LeetCode#198. House Robber
- LeetCode 198. House Robber
- leetcode 198. House Robber
- LeetCode *** 198. House Robber
- leetcode 198. House Robber
- Windows 下编译 owncloud
- JS去除字符串左右两端的空格
- Android studio 多渠道打包(超简洁版)
- JAVA内部类 (成员内部类、局部内部类、匿名内部类、静态内部类、内部类的继承))
- 在ubuntu下安装mongodb
- leetcode 198. House Robber
- thinkphp 打印下最后执行的sql语句
- 离职
- 开源SIFT特征库OpenSIFT: An Open-Source SIFT Library
- CUnit-2.1-3在Linux系统上的安装
- 导入css的三种方式
- 代码时间换空间以及空间换时间
- hdu 5706 GirlCat【暴力DFS】
- View的工作原理(1)--Measure