House Robber
来源:互联网 发布:软件营销策划方案 编辑:程序博客网 时间:2024/06/11 00:38
1 题目描述
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.
题目出处:https://leetcode.com/problems/house-robber/2 解题思路
本题属于动态规划的题,主要是找到动态规划的方程。方法可以参考http://www.cnblogs.com/ganganloveu/p/4417485.html
3 源代码
package com.larry.easy;public class HouseRobber {public int rob(int[] nums) {//max表示第i个房的最大收益int len = nums.length;int max[] = new int[len];if(len == 0) return 0;else if(len == 1) return nums[0];else{max[0] = nums[0];if(nums[0] >= nums[1]) max[1] = nums[0];else max[1] = nums[1];for(int i = 2; i < len; i++)max[i] = Math.max(max[i-2] + nums[i], max[i-1]);} return max[len-1]; }}
0 0
- House Robber
- House Robber
- House Robber
- House Robber
- House Robber
- House Robber
- House Robber
- House Robber
- House Robber
- House Robber
- House Robber
- House Robber
- House Robber
- House Robber
- House Robber
- House Robber
- House Robber
- House Robber
- select 1 from table
- Number of Digit One
- CF 3C Tic-tac-toe
- Jquery autocomplete 异步加载下拉数据
- Thrift异步IO服务器源码分析
- House Robber
- android 多媒体数据库详解
- .NET三层架构解析之Model四种设计方式
- MyEclipse8.5破解方法
- java使double保留两位小数的多方法 java保留两位小数
- ExtJs使用总结(非常详细)
- 一位ACMer过来人的心得
- js中的排序小案例
- eclipse jar包关联源码(android 开发)