LeetCode 327. Count of Range Sum（TreeMap）

最新推荐文章于 2021-02-21 10:30:10 发布

原创

最新推荐文章于 2021-02-21 10:30:10 发布 · 265 阅读

标签

#LeetCode #Hard #Java #TreeMap

收录于

这是一篇关于LeetCode 327题目的博客，主要讨论如何利用Java和TreeMap数据结构解决在给定数组中寻找满足特定范围条件的子数组和的问题。通过将子数组和转化为前缀和的差值，借助TreeMap以O(nlogn)的时间复杂度找出符合条件的子数组个数。

Count of Range Sum

Hard

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 sum of the elements in nums between indices i and j (i ≤ j), inclusive.

Note:
A naive algorithm of O(n2) is trivial. You MUST do better than that.

Example:

Input: nums = [-2,5,-1], lower = -2, upper = 2,
Output: 3 
Explanation: The three ranges are : [0,0], [2,2], [0,2] and their respective sums are: -2, -1, 2.