代码随想录day38

一、打家劫舍（LeetCode198）

class Solution {
    public int rob(int[] nums) {
        if(nums == null || nums.length == 0)    return 0;
        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];
    }
}

二、打家劫舍II（LeetCode213）

class Solution {
    public int rob(int[] nums) {
        if(nums == null || nums.length == 0)    return 0;
        if(nums.length == 1)    return nums[0];
        int result1 = robRange(nums, 0, nums.length - 2); 
        int result2 = robRange(nums, 1, nums.length - 1); 
        return Math.max(result1, result2);
    }
    public int robRange(int[] nums,int start,int end){
        if (end == start) 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];
    }
}

三、打家劫舍III（LeetCode337）

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    // 状态标记递归
    // 不偷：Max(左孩子不偷，左孩子偷) + Max(又孩子不偷，右孩子偷)
    // root[0] = Math.max(rob(root.left)[0], rob(root.left)[1]) +
    // Math.max(rob(root.right)[0], rob(root.right)[1])
    // 偷：左孩子不偷+ 右孩子不偷 + 当前节点偷
    // root[1] = rob(root.left)[0] + rob(root.right)[0] + root.val;
    public int rob(TreeNode root) {
        if(root.left == null && root.right == null) return root.val;
        int[] res = robTree(root);
        return Math.max(res[0], res[1]);
    }
    int[] robTree(TreeNode root) {
        int res[] = new int[2];//长度为2（偷或不偷）
        if (root == null)
            return res;
        int[] left = robTree(root.left);
        int[] right = robTree(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;
    }
}