leetcode315 + 二分，每个数字后面小的数个数

最新推荐文章于 2020-11-03 15:34:42 发布

小堃哥

最新推荐文章于 2020-11-03 15:34:42 发布

阅读量256

点赞数

分类专栏： Leetcode

本文链接：https://blog.csdn.net/u013554860/article/details/81266996

版权

Leetcode 专栏收录该内容

450 篇文章 0 订阅

订阅专栏

https://leetcode.com/problems/count-of-smaller-numbers-after-self/description/


class Solution {
public:
    vector<int> countSmaller(vector<int>& nums) {
        vector<int> 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;
    }
};