LeetCode Top 100 Liked Questions 198. House Robber (Java版; Easy)
题目描述
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.
classSolution{publicintrob(int[] nums){if(nums==null || nums.length==0)return0;//initializeint a =0, b = nums[0], c = nums[0];for(int i=1; i<nums.length; i++){//execute
c = Math.max(a+nums[i], b);//update
a = b;
b = c;}return c;}}
题解; 初始状态比我写的简写许多
classSolution{publicintrob(int[] nums){int len = nums.length;if(len ==0)return0;int[] dp =newint[len +1];
dp[0]=0;
dp[1]= nums[0];for(int i =2; i <= len; i++){
dp[i]= Math.max(dp[i-1], dp[i-2]+ nums[i-1]);}return dp[len];}}
LeetCode Top 100 Liked Questions 198. House Robber (Java版; Easy)
welcome to my blogLeetCode Top 100 Liked Questions 198. House Robber (Java版; Easy)题目描述You are a professional robber planning to rob houses along a street. Each house has a certain amount of money ...