count-of-range-sum

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given an integer array <code>nums</code> and two integers <code>lower</code> and <code>upper</code>, return the number of range sums that lie in <code>[lower, upper]</code> inclusive.

Range sum <code>S(i, j)</code> is defined as the sum of the elements in <code>nums</code> between indices <code>i</code> and <code>j</code> inclusive, where <code>i &lt;= j</code>.

&nbsp;
Example 1:

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

Example 2:

<pre>
Input: nums = [0], lower = 0, upper = 0
Output: 1
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= nums.length &lt;= 105</code></li>
	<li><code>-231 &lt;= nums[i] &lt;= 231 - 1</code></li>
	<li><code>-105 &lt;= lower &lt;= upper &lt;= 105</code></li>
	<li>The answer is guaranteed to fit in a 32-bit integer.</li>
</ul>

countRangeSum

Count of Range Sum

Count of Smaller Numbers After Self

count-of-smaller-numbers-after-self

计算右侧小于当前元素的个数

Reverse Pairs

reverse-pairs

翻转对

Count the Number of Fair Pairs

count-the-number-of-fair-pairs

统计公平数对的数目

Find the Number of Copy Arrays

find-the-number-of-copy-arrays

可行数组的数目

Binary Indexed Tree

Segment Tree

Array

Binary Search

Divide and Conquer

Ordered Set

Merge Sort

给你一个整数数组 <code>nums</code> 以及两个整数 <code>lower</code> 和 <code>upper</code> 。求数组中，值位于范围 <code>[lower, upper]</code> （包含 <code>lower</code> 和 <code>upper</code>）之内的 区间和的个数 。

区间和 <code>S(i, j)</code> 表示在 <code>nums</code> 中，位置从 <code>i</code> 到 <code>j</code> 的元素之和，包含 <code>i</code> 和 <code>j</code> (<code>i</code> ≤ <code>j</code>)。

 
示例 1：

<pre>
输入：nums = [-2,5,-1], lower = -2, upper = 2
输出：3
解释：存在三个区间：[0,0]、[2,2] 和 [0,2] ，对应的区间和分别是：-2 、-1 、2 。
</pre>

示例 2：

<pre>
输入：nums = [0], lower = 0, upper = 0
输出：1
</pre>

 

提示：

<ul>
	<li><code>1 <= nums.length <= 105</code></li>
	<li><code>-231 <= nums[i] <= 231 - 1</code></li>
	<li><code>-105 <= lower <= upper <= 105</code></li>
	<li>题目数据保证答案是一个 32 位 的整数</li>
</ul>