count-of-smaller-numbers-after-self

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>, return an integer array <code>counts</code> where <code>counts[i]</code> is the number of smaller elements to the right of <code>nums[i]</code>.

&nbsp;
Example 1:

<pre>
Input: nums = [5,2,6,1]
Output: [2,1,1,0]
Explanation:
To the right of 5 there are 2 smaller elements (2 and 1).
To the right of 2 there is only 1 smaller element (1).
To the right of 6 there is 1 smaller element (1).
To the right of 1 there is 0 smaller element.
</pre>

Example 2:

<pre>
Input: nums = [-1]
Output: [0]
</pre>

Example 3:

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

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= nums.length &lt;= 105</code></li>
	<li><code>-104 &lt;= nums[i] &lt;= 104</code></li>
</ul>

countSmaller

Count of Smaller Numbers After Self

Count of Range Sum

count-of-range-sum

区间和的个数

Queue Reconstruction by Height

queue-reconstruction-by-height

根据身高重建队列

Reverse Pairs

reverse-pairs

翻转对

How Many Numbers Are Smaller Than the Current Number

how-many-numbers-are-smaller-than-the-current-number

有多少小于当前数字的数字

Count Good Triplets in an Array

count-good-triplets-in-an-array

统计数组中好三元组数目

Count the Number of K-Big Indices

count-the-number-of-k-big-indices

统计 K-Big 索引的数量

Binary Indexed Tree

Segment Tree

Array

Binary Search

Divide and Conquer

Ordered Set

Merge Sort

给你一个整数数组 <code>nums</code> ，按要求返回一个新数组&nbsp;<code>counts</code> 。数组 <code>counts</code> 有该性质： <code>counts[i]</code> 的值是&nbsp; <code>nums[i]</code> 右侧小于&nbsp;<code>nums[i]</code> 的元素的数量。

&nbsp;

示例 1：

<pre>
输入：nums = [5,2,6,1]
输出：<code>[2,1,1,0] 
解释：</code>
5 的右侧有 2 个更小的元素 (2 和 1)
2 的右侧仅有 1 个更小的元素 (1)
6 的右侧有 1 个更小的元素 (1)
1 的右侧有 0 个更小的元素
</pre>

示例 2：

<pre>
输入：nums = [-1]
输出：[0]
</pre>

示例 3：

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

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= nums.length &lt;= 105</code></li>
	<li><code>-104 &lt;= nums[i] &lt;= 104</code></li>
</ul>