代码随想录算法训练营天 第九章 四十八天| 198.打家劫舍 213.打家劫舍II 337.打家劫舍III
198.打家劫舍
class Solution {
public int rob(int[] nums) {
if (nums.length == 1) {
return nums[0];
}
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-2]+nums[i],dp[i-1]);
}
return dp[nums.length-1];
}
}
213.打家劫舍II
class Solution {
public int rob(int[] nums) {
if (nums.length == 0) {
return 0;
}
if (nums.length == 1) {
return nums[0];
}
int result1 = dajia(nums, 0, nums.length-2);
int result2 = dajia(nums, 1, nums.length-1);
return result1 > result2 ? result1 : result2;
}
public int dajia(int[] nums, int start, int end) {
if (start == end) return nums[start];
int[] dp = new int[nums.length];
dp[start] = nums[start];
dp[start+1] = Math.max(nums[start],nums[start+1]);
for (int i = start+2; i <= end; i++) {
dp[i] = Math.max(dp[i-2] + nums[i], dp[i-1]);
}
return dp[end];
}
}
337.打家劫舍III
class Solution {
public int rob(TreeNode root) {
int[] res = test1(root);
return res[0] > res[1] ? res[0] : res[1];
}
public int[] test1 (TreeNode root) {
int[] res = new int[2];
if (root == null) {
return res;
}
int[] left = test1(root.left);
int[] right = test1(root.right);
res[0] = Math.max(left[0],left[1]) +Math.max(right[0], right[1]);
res[1] = root.val + left[0] + right[0];
return res;
}
}