LeetCode | House Robber
来源:互联网 发布:阿里云主机还是万网 编辑:程序博客网 时间:2024/06/07 18:54
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 { //要求不能连续抢两家即可 public int rob(int[] nums) { int length = nums.length; if(length == 0){ return 0; } if(length == 1){ //防止下面的states[i-2]发生index溢出 return nums[0]; } if(length == 2){ return Math.max(nums[0], nums[1]); } //状态变量: states[i]代表抢完第i家所能获得的最多钱数 int[] states = new int[length]; //状态转移:抢完第i家,钱数最多只有两种情况, //要么第i-2家加上第i家的钱,要么第i家钱少不抢,即: //states[i] = max( states[i-2]+nums[i],states[i-1]) states[0] = nums[0]; states[1] = Math.max(nums[0], nums[1]); for(int i=2; i<length; i++){ states[i] = Math.max(states[i-2]+nums[i], states[i-1]); } return states[length-1]; } }
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
- video element in HTML
- C语言中main函数return的总结
- HDU 1284 钱币兑换问题
- Deploy oVirt using nested virtualization environments
- ubuntu14.04 Android开发环境配置
- LeetCode | House Robber
- 位图和像素位
- 欢迎使用CSDN-markdown编辑器
- Linux LVM 创建、删除、扩展
- Linux vim如何实现文件中多行或者所有行相同列插入相同的字符串
- 环境变量配置文件
- php 文件操作
- iOS框架和服务
- Java中"=="和"equals"区别