标签：btn col contact use tomat inpu 有关 div represent
House RobberⅠ
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.
Example 1:
Input: [1,2,3,1] Output: 4 Explanation: Rob house 1 (money = 1) and then rob house 3 (money = 3). Total amount you can rob = 1 + 3 = 4.
Example 2:
Input: [2,7,9,3,1] Output: 12 Explanation: Rob house 1 (money = 2), rob house 3 (money = 9) and rob house 5 (money = 1). Total amount you can rob = 2 + 9 + 1 = 12.
1 public int rob(int[] nums) { 2 if ( nums == null || nums.length == 0 ) return 0; 3 if ( nums.length == 1 ) return nums[0]; 4 int[] dp = new int[nums.length]; 5 dp[0] = nums[0]; 6 dp[1] = Math.max(nums[0],nums[1]); 7 for ( int i = 2 ; i < nums.length ; i ++ ){ 8 dp[i] = Math.max(dp[i-1],dp[i-2]+nums[i]); 9 } 10 return Math.max(dp[nums.length-1],dp[nums.length-2]); 11 }
运行时间3ms，看了一下1ms、0ms的答案，都是舍弃dp数组，直接用一个变量表示。我觉得这反而不能体现出动态规划的思想，所以就不整理了。理解动态规划的思想才是最重要的。
标签：btn col contact use tomat inpu 有关 div represent
原文地址：https://www.cnblogs.com/boris1221/p/9314109.html
