- 通过插入排序,从头到尾确认插入的顺序,那么它所在的位置既是比它小的数的的数量,很精彩的设计和分析
- #include
#include
using namespace std;
vector getNumber(vector &nums)
{
vector t, res(nums.size());
for (int i = nums.size() - 1; i >= 0; --i) {
int left = 0, right = t.size();
while (left < right) {
int mid = left + (right - left) / 2;
if (t[mid] >= nums[i]) right = mid;
else left = mid + 1;
}
res[i] = right;
t.insert(t.begin() + right, nums[i]);
}
return res;
}
int main()
{
system(“pause”);
return 0;
}
315. Count of Smaller Numbers After Self 计算后面较小数字的个数
最新推荐文章于 2020-12-25 23:40:44 发布