问题描述
给定一个inputs
数组,输出一个相同大小的数组counts
,counts
的每个元素表示inputs
数组右边大于当前位置元素的个数。
(leetcode 315. 计算右侧小于当前元素的个数)
输入:[5,6,1,2,3]
输出:[1,0,2,1,0]
C++代码
归并排序
#include <iostream>
#include <vector>
using namespace std;
void merge(vector<int>& nums, vector<int>& counts, int left, int mid, int right, vector<int>& indexes);
void printVector(vector<int> vec);
void mergeSort(vector<int>& nums, vector<int>& counts, int left, int right, vector<int>& indexes){
if(left == right){
return;
}
int mid = left + (right - left) / 2;
mergeSort(nums, counts, left, mid, indexes);
mergeSort(nums, counts, mid + 1, right, indexes);
merge(nums, counts, left, mid, right, indexes);
}
void merge(vector<int>& nums, vector<int>& counts, int left, int mid, int right, vector<int>& indexes){
vector<int> nums_copy(nums.begin() + left, nums.begin() + right + 1);
vector<int> indexes_copy(indexes.begin() + left, indexes.begin() + right + 1);
int l = 0;
int r = mid + 1 - left;
int idx = left;
while(idx <= right && (l <= mid - left || r <= right - left)){
if(l <= mid - left && r <= right - left){
if(nums_copy[l] < nums_copy[r]){
nums[idx] = nums_copy[l];
indexes[idx] = indexes_copy[l];
counts[indexes[idx]] += right - left - r + 1;
l++;
}else{
nums[idx] = nums_copy[r];
indexes[idx] = indexes_copy[r];
r++;
}
}else{
if(l <= mid - left){
nums[idx] = nums_copy[l];
indexes[idx] = indexes_copy[l];
counts[indexes[idx]] += right - left - r + 1;
l++;
}
if(r <= right - left){
nums[idx] = nums_copy[r];
indexes[idx] = indexes_copy[r];
r++;
}
}
idx++;
}
}
void printVector(vector<int> vec){
int n = vec.size();
for(int i = 0; i < n; i++){
cout << vec[i];
if(i != n - 1){
cout << " ";
}
}
cout << endl;
}
int main(){
vector<int> inputs{5,6,1,2,3,2,3,1,3,5};
int n = inputs.size();
vector<int> counts(n, 0);
vector<int> indexes(n);
for(int i = 0; i < n; i++){
indexes[i] = i;
}
mergeSort(inputs, counts, 0, n-1, indexes);
printVector(counts);
return 0;
}
代码分析
时间复杂度:O(nlogn)
,归并排序的时间复杂度;
空间复杂度:O(n)
,创建了 indexes 数组 O(n),归并排序递归深度 O(logn)。