Count of Smaller Numbers After Self
Given an integer array nums, return an integer array counts where counts[i] is the number of smaller elements to the right of nums[i].
Example 1
Input
nums = [5,2,6,1]Output
[2,1,1,0]To the right of 5 there are 2 smaller elements, to the right of 2 there is 1, to the right of 6 there is 1, and to the right of 1 there are 0.
Example 2
Input
nums = [-1]Output
[0]There are no elements to the right of the only element.
Constraints
- 1 <= nums.length <= 10^5
- -10^4 <= nums[i] <= 10^4