标签：numbers begin return sub 代码 class div The 二分
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 the right of 5 there are 2 smaller elements (2 and 1).
To the right of 2 there is only 1 smaller element (1).
To the right of 6 there is 1 smaller element (1).
To the right of 1 there is 0 smaller element.
class Solution { public: vector<int> countSmaller(vector<int>& nums) { vector<int> after,res(nums.size()); for(int i=nums.size()-1;i>=0;--i) { auto iter=lower_bound(after.begin(),after.end(),nums[i]); res[i]=iter-after.begin(); after.insert(iter,nums[i]); } return res; } };
315. Count of Smaller Numbers After Self
标签：numbers begin return sub 代码 class div The 二分
原文地址：https://www.cnblogs.com/lychnis/p/11968238.html
