力扣——315. 计算右侧小于当前元素的个数

问题描述

问题分析

本题采用分治思想进行处理，单独处理较长数组算法复杂度过大，先拆分为短对象进行处理，最后将结果进行合并。
针对拆分出来的较短数组的处理：

class Solution {
public:
    vector<int> countSmaller(vector<int>& nums) {
        vector<pair<int, int>>vec;//将数组值与index关联
        vector<int>count;//记录结果
        for (int i = 0; i < nums.size(); i++) {
            vec.push_back(make_pair(nums[i], i));
            count.push_back(0);//初始先拿0填充
        }
        merge_sort(vec, count);
        return count;
    }
private:
    //将两个数组合并(按顺序)
    void merge_sort_two_vec(
        vector<pair<int, int>>& sub_vec1,
        vector<pair<int, int>>& sub_vec2,
        vector<pair<int, int>>& vec,//整合后的
        vector<int>& count
    ) {
        int i = 0;
        int j = 0;
        while (i < sub_vec1.size() && j < sub_vec2.size()) {
            if (sub_vec1[i].first <= sub_vec2[j].first) {
                count[sub_vec1[i].second] += j;
                vec.push_back(sub_vec1[i]);
                i++;
            }
            else {
                vec.push_back(sub_vec2[j]);
                j++;
            }
        }
        for (; i < sub_vec1.size(); i++) {
            count[sub_vec1[i].second] += j;
            vec.push_back(sub_vec1[i]);
        }
        for (; j < sub_vec2.size(); j++) {
            vec.push_back(sub_vec2[j]);
        }
    }
    void merge_sort(vector<pair<int, int>>& vec, vector<int>& count) {
        if (vec.size() < 2) {
            return;
        }
        //分治
        int mid = vec.size() / 2;
        vector<pair<int, int>>sub_vec1;
        vector<pair<int, int>>sub_vec2;
        for (int i = 0; i < mid; i++) {
            sub_vec1.push_back(vec[i]);
        }
        for (int i = mid; i < vec.size(); i++) {
            sub_vec2.push_back(vec[i]);
        }
        //递归调用不断划分直至最小单元
        merge_sort(sub_vec1, count);
        merge_sort(sub_vec2, count);
        vec.clear();
        //合并
        merge_sort_two_vec(sub_vec1, sub_vec2, vec, count);
    }
};