题目内容
给定二叉搜索树的根结点 root,返回值位于范围 [low, high] 之间的所有结点的值的和。
示例 1:
输入:root = [10,5,15,3,7,null,18], low = 7, high = 15
输出:32
示例 2:
输入:root = [10,5,15,3,7,13,18,1,null,6], low = 6, high = 10
输出:23
提示:
树中节点数目在范围 [1, 2 * 104] 内
1 <= Node.val <= 105
1 <= low <= high <= 105
所有 Node.val 互不相同
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/range-sum-of-bst
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
java解答
- 先序遍历解答
/**
* 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 {
int sum=0;
public int rangeSumBST(TreeNode root, int low, int high) {
if(root==null){
return 0;
}
if(root.val>=low&&root.val<=high){
sum+=root.val;
}
rangeSumBST(root.left,low,high);
rangeSumBST(root.right,low,high);
return sum;
}
}
- 利用搜索二叉树的性质进行筛选 时间100%
/**
* 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 {
int sum=0;
public int rangeSumBST(TreeNode root, int low, int high) {
if(root==null){
return 0;
}
if(root.val>high){
rangeSumBST(root.left,low,high);
}else if(root.val<low){
rangeSumBST(root.right,low,high);
}else{
sum+=root.val;
rangeSumBST(root.left,low,high);
rangeSumBST(root.right,low,high);
}
return sum;
}
}
总结
rangeSumBST(root.right,low,high);
}
return sum;
}
}
# 总结
当一个变量你想让他只用一次,而生命在一个方法里时候,这个方法总会被调用多次的时候,可以考虑拿到外面,这样可以达到目的.