LeetCode(力扣)968. 监控二叉树Python

板砖大的砖头

于 2023-09-16 22:20:51 发布

阅读量257

点赞数

分类专栏： Python刷题记录文章标签： leetcode python 算法职场和发展

本文链接：https://blog.csdn.net/qq_44953660/article/details/132926632

版权

Python刷题记录专栏收录该内容

54 篇文章 0 订阅

订阅专栏

LeetCode968. 监控二叉树

- 题目链接
- 代码

题目链接

https://leetcode.cn/problems/binary-tree-cameras/description/
在这里插入图片描述

代码

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def minCameraCover(self, root: Optional[TreeNode]) -> int:
        result = [0]
        if self.traversal(root, result) == 0:
            result[0] += 1
        return result[0]
    
    def traversal(self, cur, result):
        if not cur:
            return 2
        left = self.traversal(cur.left, result)
        right = self.traversal(cur.right, result)

        if left == 2 and right == 2:
            return 0
        if left == 0 or right == 0:
            result[0] += 1
            return 1
        if left == 1 or right == 1:
            return 2