human
I found an interesting problem on https://leetcode.com/problems/count-of-smaller-numbers-after-self/:
You are given an integer array nums and you have to return a new counts array. The counts array has the property where counts[i] is the number of smaller elements to the right of nums[i].

Example:

Input: [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.

I tried it in Python, but could not do it. Can you solve it?
assistant
#Here is the Python code you requested.

class Solution:
     def countSmaller(self, nums):
         """
         :type nums: List[int]
         :rtype: List[int]
         """
         s = sorted(nums)
         c = []
         for n in nums:
             p = bisect.bisect_left(s, n)
             c.append(p)
             s.pop(p)
         return c