在数组中的两个数字如果前面一个数字大于后面的数字,则这两个数字组成一个逆序对。给你一个数组,求出这个数组中逆序对的总数。
概括:如果a[i] > a[j] 且 i < j, a[i] 和 a[j] 构成一个逆序对。
序列 [2, 4, 1, 3, 5]
中,有 3 个逆序对 (2, 1)
, (4, 1)
, (4, 3)
,则返回 3
。
1.简单的循环方法时间复杂度为O(n^2)
public class Solution {
/**
* @param A an array
* @return total of reverse pairs
*/
public long reversePairs(int[] A) {
// Write your code here
if(A.length==0 || A==null)
return 0;
long count = 0;
for(int i=0; i<A.length-1;i++)
for(int j = i+1;j<A.length;j++){
if(A[i]>A[j])
count++;
}
return count;
}
}
1.归并排序的思想时间复杂度为O(nlogn)
归并排序在合并过程中,对于两个要合并的序列a[low,mid]和a[mid+1,high],设low<=i<=mid,mid<j<=high,若a[i]<=a[j],即不是逆序对;反之a[i]>a[j]时,a[i+1]~a[mid]都大于a[j],有mid-i+1个逆序对
参考http://blog.csdn.net/ljiabin/article/details/44819129
public class Solution {/**
* @param A an array
* @return total of reverse pairs
*/
public long count = 0;
public long reversePairs(int[] A) {
// Write your code here
if(A.length==0 || A==null)
return 0;
MergeSort(A,0,A.length-1);
return count;
}
public void MergeSort(int[] A, int low, int high){
if(low < high){
int mid = (low+high)/2;
MergeSort(A,low,mid);
MergeSort(A,mid+1,high);
Merge(A,low,mid,high);
}
}
public void Merge(int[] A,int low, int mid, int high){
int i=low;
int j = mid+1;
int k = 0;
int[] temp = new int[high-low+1];//用来保存一趟归并结束的排序数组
while(i<=mid && j<=high){
if(A[i]<=A[j]){
temp[k] = A[i];
k++;
i++;
}
else{
count += mid-i+1;
temp[k] = A[j];
k++;
j++;
}
}
while(i<=mid){
temp[k] = A[i];
k++;
i++;
}
while(j<=high){
temp[k] = A[j];
k++;
j++;
}
int m = low;
int n = 0;
while (m <= high) {
A[m++] = temp[n++];
}
}
}