315. Count of Smaller Numbers After Self(Leetcode每日一题-2020.07.11)
Problem
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
原创
2020-07-12 10:13:12 ·
242 阅读 ·
0 评论