题目来源
题目描述
题目解析
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
private int count = 0;
public int goodNodes(TreeNode root) {
helper(root, Integer.MIN_VALUE);
return count;
}
private void helper(TreeNode root, int val){
if (root == null){
return;
}
if (root.val >= val){ // 注意这里是大于等于
val = root.val;
count++;
}
helper(root.left, val);
helper(root.right, val);
}
}