LeetCode 1365. How Many Numbers Are Smaller Than the Current Number

問題：找出陣列每個小於nums[i]的數量
解法：用filter即可
JavaScript

/**
 * @param {number[]} nums
 * @return {number[]}
 */
var smallerNumbersThanCurrent = function (nums) {
    if (nums.length < 2 || nums.length > 500) {
        return;
    }

    let temp = [];
    nums.forEach((v) => {
        const count = nums.filter(i => i < v).length
        temp.push(count);
    });
    return temp;
};