《剑指offer》系列 数组中的逆序对（Java）

链接

牛客：数组中的逆序对

LeetCode：剑指 Offer 51. 数组中的逆序对

思路

归并排序（MergeSort）的变种，主要是将merge方法改写。

代码

public class Solution {

	private int total = 0;
    public int InversePairs(int [] array) {
        if (array == null) {
            return 0;
        }
        mergeSort(array, 0, array.length - 1);
        return total;
    }
    
    private void mergeSort(int[] array, int low, int high) {
        int mid = (low + high) / 2;
        if (low < high) {
            mergeSort(array, low, mid);
            mergeSort(array, mid + 1, high);
            merge(array, low, mid, high);
        }
    }
    
    private void merge(int[] array, int low, int mid, int high) {
        int len = high - low + 1;
        int i = low;
        int j = mid + 1;
        int[] data = new int[len];
        int k = 0;
        while (i <= mid && j <= high) {
            if (array[i] <= array[j]) {
                data[k++] = array[i++];
            } else {
                data[k++] = array[j++];
                //如果array[i] > array[j]，表示array[i]到array[mid]都小于array[j]
                total += mid - i + 1;
                // 数的量级比较大，所以每一次合并之后都要取模
                total %= 1000000007;
            }
        }
        while (i <= mid) {
            data[k++] = array[i++];
        }
        while (j <= high) {
            data[k++] = array[j++];
        }
        for (int x = 0; x< len; x++) {
            array[low + x] = data[x];
        }
    }
}