Count of Smaller Numbers After Self

Hard

Given an integer array nums, return an array counts where counts[i] is the number of elements to the right of nums[i] that are smaller than nums[i].

Example 1

Input:  nums = [5,2,6,1]
Output: [2,1,1,0]
Explanation: To the right of 5 are 2 and 1; to the right of 2 is 1; to the right of 6 is 1; nothing is right of 1.

Example 2

Input:  nums = [-1,-1]
Output: [0,0]

Constraints

• 1 <= nums.length <= 10^5
• -10^4 <= nums[i] <= 10^4