BM20 数组中的逆序对
题目链接:BM20 数组中的逆序对
思路:分治思想,本质是归并排序或者快排。
代码:
//归并排序
//首先将数组进行拆分,每次平均分成两组(类似二叉树),直到单独一个元素
//然后对每个元素进行归并,归并的过程中,两个子数组都是有序的(类似合并有序数组)
class Solution {
public:
//取模就是取余数
void merge(vector<int>& data, vector<int>& copy,int left, int right, long long& count){
if(left < right){//当left>=right时就说明已经拆分成元素了
//将数组对半分开
int mid = (left+right)/2;
//左半边,闭区间
merge(data, copy, left, mid, count);
//右半边,闭区间
merge(data, copy, mid+1, right, count);
//排序,要写在判断语句里面。若写在外面那么只能将两两判断大小
//一个是left到mid,一个是mid+1到right
int curLeft = left;
int curRight = mid+1;
int cur=left;//cur用来遍历copy,cur的范围为left至right
while(curLeft<=mid && curRight<=right){
if(data[curLeft]<data[curRight]){
copy[cur++] = data[curLeft++];
}
else{
copy[cur++] = data[curRight++];
count = count + mid - curLeft + 1;
}
}
while(curLeft<=mid){
copy[cur++] = data[curLeft++];
}
while(curRight<=right){
copy[cur++] = data[curRight++];
}
//这个是必须的,将排序好的再赋给原始数组
for(int i=left; i<=right; i++){
data[i] = copy[i];
}
}
}
int InversePairs(vector<int> data) {
vector<int> copy(data.size(), 0);
int left = 0;
int right = data.size()-1;
long long count=0;
merge(data, copy, left, right, count);
count = count%1000000007;
return count;
}
};
------------------------------------额外题目---------------------------------
(以上为训练营每日任务,本部分为自己刷题进度)