-
Notifications
You must be signed in to change notification settings - Fork 7
/
Program.cs
55 lines (50 loc) · 1.3 KB
/
Program.cs
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
//前序更新max,后序记录结果。
using System;
namespace CountGoodNodesInBinaryTree
{
public class TreeNode
{
public int val;
public TreeNode left;
public TreeNode right;
public TreeNode(int val = 0, TreeNode left = null, TreeNode right = null)
{
this.val = val;
this.left = left;
this.right = right;
}
}
class Program
{
static void Main(string[] args)
{
var a = new TreeNode(3);
var b = new TreeNode(1);
var c = new TreeNode(4);
var d = new TreeNode(3);
var e = new TreeNode(1);
var f = new TreeNode(5);
a.left = b;
a.right = c;
b.left = d;
c.left = e;
c.right = f;
Console.WriteLine(GoodNodes(a));
}
private static int res;
static int GoodNodes(TreeNode root)
{
DFS(root, int.MinValue);
return res;
}
static void DFS(TreeNode node, int max)
{
if(node == null) return;
max = Math.Max(max, node.val);
DFS(node.left, max);
DFS(node.right, max);
if (node.val >= max)
res++;
}
}
}