coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-06 07:51:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

存量题库数据更新

Browse Source
This commit is contained in:
小墨
2023-12-09 18:42:21 +08:00
parent a788808cd7
commit c198538f10
10843 changed files with 288489 additions and 248355 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode/problem/count-good-nodes-in-binary-tree.html
View File

@@ -3,7 +3,7 @@
<p>Return the number of <strong>good</strong> nodes in the binary tree.</p>
<p>&nbsp;</p>
@@ -16,7 +16,7 @@ Node 4 -&gt; (3,4) is the maximum value in the path starting from the root.
<pre>
<pre>
<strong>Input:</strong> root = [3,1,4,3,null,1,5]
@@ -25,7 +25,7 @@ Node 3 -&gt; (3,1,3) is the maximum value in the path.</pre>
<strong>Explanation:</strong> Nodes in blue are <strong>good</strong>.
Root Node (3) is always a good node.
Node 4 -&gt; (3,4) is the maximum value in the path starting from the root.
Node 5 -&gt; (3,4,5) is the maximum value in the path