problem 938. Range Sum of BST 参考 1. Leetcode_easy_938. Range Sum of BST; 完…

作者: 负雪明烛 id: fuxuemingzhu 个人博客: http://fuxuemingzhu.cn/ 目录 题目描述 题目大意 解题方法 递归 日期 题目地址:https://leetcode.com/contest/weekly-contest-110/problems/range-sum-of-bst/ 题目描述 Given the root node of a binary search tree, return the sum of values of all nodes wi…

作者: 负雪明烛 id: fuxuemingzhu 个人博客: http://fuxuemingzhu.cn/ 目录 题目描述 题目大意 解题方法 预先求和 相似题目 参考资料 日期 题目地址:https://leetcode.com/problems/range-sum-query-2d-immutable/description/ 题目描述 Given a 2D matrix matrix, find the sum of the elements inside the rectangle…

problem 653. Two Sum IV - Input is a BST 参考 1. Leetcode_easy_653. Two Sum IV - Input is a BST; 完…

作者: 负雪明烛 id: fuxuemingzhu 个人博客: http://fuxuemingzhu.cn/ 目录 题目描述 解题方法 保存累积和 日期 题目地址:https://leetcode.com/problems/range-sum-query-immutable/description/ 题目描述 Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), in…

Given the root node of a binary search tree, return the sum of values of all nodes with value between L and R (inclusive). The binary search tree is guaranteed to have unique values. Example 1: Input: root = [10,5,15,3,7,null,18], L = 7, R = 15 Outpu…

problem 783. Minimum Distance Between BST Nodes 参考 1. Leetcode_easy_783. Minimum Distance Between BST Nodes; 完…

problem 598. Range Addition II 题意: 第一感觉就是最小的行和列的乘积即是最后结果. class Solution { public: int maxCount(int m, int n, vector<vector<int>>& ops) { for(auto op : ops) { m = min(m, op[]); n = min(n, op[]); } return m*n; } }; 参考 1. Leetcode_easy_598.…

题目如下: 解题思路:就三个字-线段树.这个题目是线段树用法最经典的场景. 代码如下: class NumArray(object): def __init__(self, nums): """ :type nums: List[int] """ self.nl = nums self.tree = [] if len(nums) == 0: return for i in xrange((4*len(nums)+1)): self.tree.a…

import functools # Definition for a binary tree node. # class TreeNode(object): # def __init__(self, x): # self.val = x # self.left = None # self.right = None @functools.lru_cache() class Solution(object): def rangeSumBST(self, root, L, R): ""&q…