blob: b6b9b3ebbf6f27b4754ad528da7f3a46813c6213 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
|
#include "leetcode.h"
class Solution {
public:
int goodNodes(TreeNode *root) {
dfs(root, root->val);
return count;
}
private:
int count = 0;
void dfs(TreeNode *node, int currMax) {
if (!node)
return;
if (node->val >= currMax) {
count++;
currMax = node->val;
}
dfs(node->left, currMax);
dfs(node->right, currMax);
}
};
|