Package g1301_1400.s1365_how_many_numbers_are_smaller_than_the_current_number

Class Solution

java.lang.Object

g1301_1400.s1365_how_many_numbers_are_smaller_than_the_current_number.Solution

public class Solution
extends Object

1365 - How Many Numbers Are Smaller Than the Current Number.<p>Easy</p> <p>Given the array <code>nums</code>, for each <code>nums[i]</code> find out how many numbers in the array are smaller than it. That is, for each <code>nums[i]</code> you have to count the number of valid <code>j's</code> such that <code>j != i</code> <strong>and</strong> <code>nums[j] < nums[i]</code>.</p> <p>Return the answer in an array.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> nums = [8,1,2,2,3]</p> <p><strong>Output:</strong> [4,0,1,1,3]</p> <p><strong>Explanation:</strong></p> <p>For nums[0]=8 there exist four smaller numbers than it (1, 2, 2 and 3).</p> <p>For nums[1]=1 does not exist any smaller number than it.</p> <p>For nums[2]=2 there exist one smaller number than it (1).</p> <p>For nums[3]=2 there exist one smaller number than it (1).</p> <p>For nums[4]=3 there exist three smaller numbers than it (1, 2 and 2).</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> nums = [6,5,4,8]</p> <p><strong>Output:</strong> [2,1,0,3]</p> <p><strong>Example 3:</strong></p> <p><strong>Input:</strong> nums = [7,7,7,7]</p> <p><strong>Output:</strong> [0,0,0,0]</p> <p><strong>Constraints:</strong></p> <ul> <li><code>2 <= nums.length <= 500</code></li> <li><code>0 <= nums[i] <= 100</code></li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int[]	smallerNumbersThanCurrent(int[] nums)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

smallerNumbersThanCurrent

public int[] smallerNumbersThanCurrent(int[] nums)