分段树
文章平均质量分 81
jmspan
这个作者很懒,什么都没留下…
展开
-
LeetCode 327. Count of Range Sum(区间和计数)
原题网址:https://leetcode.com/problems/count-of-range-sum/Given an integer array nums, return the number of range sums that lie in [lower, upper] inclusive.Range sum S(i, j) is defined as the su原创 2016-04-28 00:32:14 · 3701 阅读 · 0 评论 -
LeetCode 307. Range Sum Query - Mutable(区间之和)
原题网址:https://leetcode.com/problems/range-sum-query-mutable/Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive.The update(i, val) function mo原创 2016-04-20 07:58:00 · 639 阅读 · 0 评论 -
LeetCode 315. Count of Smaller Numbers After Self (逆序数对)
原题网址:https://leetcode.com/problems/count-of-smaller-numbers-after-self/You are given an integer array nums and you have to return a new counts array. The counts array has the property where coun原创 2016-04-22 13:21:32 · 7431 阅读 · 2 评论