mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-10 18:48:13 +08:00
37 lines
1.1 KiB
HTML
37 lines
1.1 KiB
HTML
<p>Given an integer array <code>nums</code>, return<em> an integer array </em><code>counts</code><em> where </em><code>counts[i]</code><em> is the number of smaller elements to the right of </em><code>nums[i]</code>.</p>
|
|
|
|
<p> </p>
|
|
<p><strong class="example">Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> nums = [5,2,6,1]
|
|
<strong>Output:</strong> [2,1,1,0]
|
|
<strong>Explanation:</strong>
|
|
To the right of 5 there are <b>2</b> smaller elements (2 and 1).
|
|
To the right of 2 there is only <b>1</b> smaller element (1).
|
|
To the right of 6 there is <b>1</b> smaller element (1).
|
|
To the right of 1 there is <b>0</b> smaller element.
|
|
</pre>
|
|
|
|
<p><strong class="example">Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> nums = [-1]
|
|
<strong>Output:</strong> [0]
|
|
</pre>
|
|
|
|
<p><strong class="example">Example 3:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> nums = [-1,-1]
|
|
<strong>Output:</strong> [0,0]
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= nums.length <= 10<sup>5</sup></code></li>
|
|
<li><code>-10<sup>4</sup> <= nums[i] <= 10<sup>4</sup></code></li>
|
|
</ul>
|