No.152 - LeetCode938

ShellDawn

于 2019-12-13 01:17:29 发布

阅读量112

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode 文章标签： LeetCode

本文链接：https://blog.youkuaiyun.com/ShellDawn/article/details/103519103

leetcode 专栏收录该内容

251 篇文章

订阅专栏

func dfs(now *TreeNode, L int,R int, p *int) {
    if now.Left != nil && now.Val >= L {
        dfs(now.Left,L,R,p)
    }
    if now.Right != nil && now.Val <= R {
        dfs(now.Right,L,R,p)
    }
    if now.Val >= L && now.Val <= R {
        *p += now.Val
    }
}

func rangeSumBST(root *TreeNode, L int, R int) int {
    if root == nil {return 0}
    ans := 0
    dfs(root,L,R,&ans)
    return ans
}