[leetcode] 1448. Count Good Nodes in Binary Tree

Description

Given a binary tree root, a node X in the tree is named good if in the path from root to X there are no nodes with a value greater than X.

Return the number of good nodes in the binary tree.

Example 1:

Input: root = [3,1,4,3,null,1,5]
Output: 4
Explanation: Nodes in blue are good.
Root Node (3) is always a good node.
Node 4 -> (3,4) is the maximum value in the path starting from the root.
Node 5 -> (3,4,5) is the maximum value in the path
Node 3 -> (3,1,3) is the maximum value in the path.

Example 2:

Input: root = [3,3,null,4,2]
Output: 3
Explanation: Node 2 -> (3, 3, 2) is not good, because "3" is higher than it.

Example 3:

Input: root = [1]
Output: 1
Explanation: Root is considered as good.

Constraints:

• The number of nodes in the binary tree is in the range [1, 10^5].
• Each node’s value is between [-10^4, 10^4].

分析

题目的意思是：统计一颗二叉树里面好结点的个数，好结点必须不小于父结点，如果把父结点的最大值当成参数往下传就能够判断了，如果能够想到这点剩下的就是递归就行了。

• 我看了一下其他人的解法，思路差不多，只不过我是用全局变量cnt来统计good结点的个数，他们是当成返回值回传的，所以在写法上有点不一样。

代码

# 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 solve(self,root,maxVal):
        if(root is None):
            return 
        if(root.val>=maxVal):
            self.cnt+=1
        maxVal=max(maxVal,root.val)
        self.solve(root.left,maxVal)
        self.solve(root.right,maxVal)
        
    def goodNodes(self, root: TreeNode) -> int:
        self.cnt=0
        self.solve(root,root.val)
        return self.cnt

参考文献

[LeetCode] [Java/C++/Python] One line