原题目:https://leetcode-cn.com/problems/how-many-numbers-are-smaller-than-the-current-number/
思路:
采用计数排序的方法
代码:
class Solution {
public:
vector<int> smallerNumbersThanCurrent(vector<int>& nums) {
vector<int> cnt(101, 0);
int n = nums.size();
for (int i = 0; i < n; i++) {
cnt[nums[i]]++;
}
for (int i = 1; i <= 100; i++) {
cnt[i] += cnt[i - 1];
}
vector<int> ret;
for (int i = 0; i < n; i++) {
ret.push_back(nums[i] == 0 ? 0: cnt[nums[i]-1]);
}
return ret;
}
};