文章阅读
动态规划,抢劫和不抢劫
class Solution {
public int rob(int[] nums) {
int n = nums.length;
if(n == 0) return 0;
if(n == 1) return nums[0];
int[] dp = new int[n + 1]; //前i个房子能获得的金额
//base case
dp[0] = 0;
dp[1] = nums[0];
for(int i = 2; i <= n; i++){
dp[i] = Math.max(dp[i - 1], nums[i - 1] + dp[i - 2]);
}
return dp[n];
}
}
题目
打家劫舍
class Solution {
public int rob(int[] nums) {
int n = nums.length;
if(n == 0) return 0;
if(n == 1) return nums[0];
int[] dp = new int[n + 1];
dp[0] = 0; dp[1] = nums[0];
for(int i = 2; i <= n; i++){
dp[i] = Math.max(dp[i - 1], nums[i - 1] + dp[i - 2]);
}
return dp[n];
}
}
打家劫舍II
class Solution {
public int rob(int[] nums) {
int n = nums.length;
if(n == 1) return nums[0];
return Math.max(help(Arrays.copyOfRange(nums, 0, nums.length - 1)),
help(Arrays.copyOfRange(nums, 1, nums.length)));
}
public int help(int[] nums) {
int n = nums.length;
if(n == 0) return 0;
if(n == 1) return nums[0];
int[] dp = new int[n + 1];
dp[0] = 0; dp[1] = nums[0];
for(int i = 2; i <= n; i++){
dp[i] = Math.max(dp[i - 1], nums[i - 1] + dp[i - 2]);
}
return dp[n];
}
}
打家劫舍III
class Solution {
public int rob(TreeNode root) {
int[] dp = dfs(root);
return Math.max(dp[0], dp[1]);
}
public int[] dfs(TreeNode root){
if(root == null) return new int[]{0, 0};
int[] left = dfs(root.left);
int[] right = dfs(root.right);
int norob = Math.max(left[0], left[1]) + Math.max(right[0], right[1]);
int rob = left[0] + right[0] + root.val;
return new int[]{norob, rob};
}
}