mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
39 lines
1.1 KiB
HTML
39 lines
1.1 KiB
HTML
|
<p>给你一个整数数组 <code>nums</code><em> </em>，按要求返回一个新数组 <code>counts</code><em> </em>。数组 <code>counts</code> 有该性质： <code>counts[i]</code> 的值是 <code>nums[i]</code> 右侧小于 <code>nums[i]</code> 的元素的数量。</p>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>示例 1：</strong></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入：</strong>nums = [5,2,6,1]
|
|||
|
|
<strong>输出：</strong><code>[2,1,1,0]
|
|||
|
|
<strong>解释：</strong></code>
|
|||
|
|
5 的右侧有 <strong>2 </strong>个更小的元素 (2 和 1)
|
|||
|
|
2 的右侧仅有 <strong>1 </strong>个更小的元素 (1)
|
|||
|
|
6 的右侧有 <strong>1 </strong>个更小的元素 (1)
|
|||
|
|
1 的右侧有 <strong>0 </strong>个更小的元素
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p><strong>示例 2：</strong></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入：</strong>nums = [-1]
|
|||
|
|
<strong>输出：</strong>[0]
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p><strong>示例 3：</strong></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入：</strong>nums = [-1,-1]
|
|||
|
|
<strong>输出：</strong>[0,0]
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>提示：</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>
|