zoukankan      html  css  js  c++  java
  • [每日一题]leetcode 938. 二叉搜索树的范围和

    /**
     * Definition for a binary tree node.
     * struct TreeNode {
     *     int val;
     *     TreeNode *left;
     *     TreeNode *right;
     *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
     *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
     *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
     * };
     */
    class Solution {
    public:
        int rangeSumBST(TreeNode* root, int low, int high) {
            if(root == nullptr) return 0;
            int sum = 0;
            sum = rangeSumBST(root->left, low, high);
            sum += rangeSumBST(root->right, low, high);
            if(root->val >= low && root->val <= high) sum += root->val;
            return sum;
        }
    };
    自己选择的路,跪着也要走完。朋友们,虽然这个世界日益浮躁起来,只要能够为了当时纯粹的梦想和感动坚持努力下去,不管其它人怎么样,我们也能够保持自己的本色走下去。
  • 相关阅读:
    Python with
    Python else
    Python list
    The Python Debugger Pdb
    RPM 包
    yum
    OpenStack I18N
    Python unittest
    MySQL 行格式
    MySQL 行溢出数据
  • 原文地址:https://www.cnblogs.com/WTSRUVF/p/14710018.html
Copyright © 2011-2022 走看看