/**
* 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 {
int res=0;
public int minCameraCover(TreeNode root) {
if(minCame(root)==0){
res++;
}
return res;
}
public int minCame(TreeNode root){
if(root == null){
return 2;
}
int left = minCame(root.left);
int right = minCame(root.right);
if(left == 2 && right ==2){
return 0;
}else if(left == 0 || right == 0){
res++;
return 1;
}else{
return 2;
}
}
}
代码随想录——968.监控二叉树
最新推荐文章于 2024-10-03 13:36:06 发布