标签：long cal etc one call tco from bsp stop
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.
使用动态规划DP
public class Solution { public int rob(int[] nums) { if (nums.length == 0){ return 0; } if (nums.length == 1){ return nums[0]; } if (nums.length == 2){ return Math.max(nums[0], nums[1]); } int[] dp = new int[nums.length]; dp[0] = nums[0]; dp[1] = Math.max(nums[0], nums[1]); for (int i = 2; i < nums.length; i++){ dp[i] = Math.max(dp[i - 1], dp[i - 2] + nums[i]); } return dp[nums.length - 1]; } }
可以优化一下
public int rob(int[] num) { int prevMax = 0; int currMax = 0; for (int x : num) { int temp = currMax; currMax = Math.max(prevMax + x, currMax); prevMax = temp; } return currMax; }
leetcode 198. House Robber 求抢劫的最大金额 ---------- java
标签：long cal etc one call tco from bsp stop
原文地址：http://www.cnblogs.com/xiaoba1203/p/6610906.html
