leetcode1365

class Solution:
    def smallerNumbersThanCurrent(self, nums: List[int]) -> List[int]:
        sorted_nums = sorted(nums)
        n = len(nums)
        index = 0
        dic = {}
        for i in range(n):
            cur = sorted_nums[i]
            if cur not in dic:
                dic[cur] = index
            index += 1
        result = []
        for i in range(n):
            cur = nums[i]
            result.append(dic[cur])
        return result

算法思路：hash