LeetCode: 315. Count of Smaller Numbers After Self

LeetCode: 315. 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.

解题思路

按照题意模拟就可以 AC

AC 代码

func countSmaller(nums []int) []int {
    ans := make([]int, len(nums))
    
    for i := 0; i < len(nums); i++ {
        for j := i+1; j < len(nums); j++ {
            if nums[i] > nums[j] {
                ans[i]++
            }
        }
    }
    
    return ans
}