【LeetCode】 1365. How Many Numbers Are Smaller Than the Current Number 有多少小于当前数字的数字（Easy）（JAVA）

【LeetCode】 1365. How Many Numbers Are Smaller Than the Current Number 有多少小于当前数字的数字（Easy）（JAVA）

题目地址: https://leetcode.com/problems/how-many-numbers-are-smaller-than-the-current-number/

题目描述：

Given the array nums, for each nums[i] find out how many numbers in the array are smaller than it. That is, for each nums[i] you have to count the number of valid j’s such that j != i and nums[j] < nums[i].

Return the answer in an array.

Example 1:

Input: nums = [8,1,2,2,3]
Output: [4,0,1,1,3]
Explanation: 
For nums[0]=8 there exist four smaller numbers than it (1, 2, 2 and 3). 
For nums[1]=1 does not exist any smaller number than it.
For nums[2]=2 there exist one smaller number than it (1). 
For nums[3]=2 there exist one smaller number than it (1). 
For nums[4]=3 there exist three smaller numbers than it (1, 2 and 2).

Example 2:

Input: nums = [6,5,4,8]
Output: [2,1,0,3]

Example 3:

Input: nums = [7,7,7,7]
Output: [0,0,0,0]
``` 

Constraints:

* 2 <= nums.length <= 500
* 0 <= nums[i] <= 100



## 题目大意

给你一个数组 nums，对于其中每个元素 nums[i]，请你统计数组中比它小的所有数字的数目。

换而言之，对于每个 nums[i] 你必须计算出有效的 j 的数量，其中 j 满足 j != i 且 nums[j] < nums[i] 。

以数组形式返回答案。


## 解题方法

最容易想到的就是 O(n^2) 的方法：两次循环遍历即可，存储 O(1) 

下面采用的 O(nlogn) 的方法，但是需要 O(n) 的存储空间

1、对数组进行排序 O(nlogn)
2、因为数组从小到大排序了，把排序的元素位置存到 Map 里面
3、遍历找出该元素的排序位置

class Solution {
public int[] smallerNumbersThanCurrent(int[] nums) {
int[] res = nums.clone();
Arrays.sort(res);
Map<Integer, Integer> map = new HashMap<>();
for (int i = 0; i < res.length; i++) {
Integer temp = map.get(res[i]);
if (temp == null) {
map.put(res[i], i);
}
}
for (int i = 0; i < nums.length; i++) {
res[i] = map.get(nums[i]);
}
return res;
}
}

执行耗时:4 ms,击败了73.11% 的Java用户
内存消耗:38.3 MB,击败了97.67% 的Java用户