Leetcode 968. Binary Tree Cameras（动态规划与递归）

Leetcode 968. Binary Tree Cameras

题目链接： Binary Tree Cameras

难度：Hard

题目大意：

详见题目。

思路：

参考官方题解。

代码

/**
 * 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 {
    //参考solution
    public int minCameraCover(TreeNode root) {
        int[] res=helper(root);
        return Math.min(res[1],res[2]);
    }
    public int[] helper(TreeNode root){
        if(root==null){
            return new int[]{0,0,99999};
        }
        int[] left=helper(root.left);
        int[] right=helper(root.right);
        int minLeft12=Math.min(left[1],left[2]);
        int minRight12=Math.min(right[1],right[2]);
        int d0=left[1]+right[1];
        int d1=Math.min(left[2]+minRight12,right[2]+minLeft12);
        int d2=1+Math.min(left[0],minLeft12)+Math.min(right[0],minRight12);
        return new int[]{d0,d1,d2};
    }
}