剑指Offer(牛客网)-数组中的逆序对

题目来源：

https://www.nowcoder.com/practice/96bd6684e04a44eb80e6a68efc0ec6c5?tpId=13&tqId=11188&tPage=2&rp=2&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking

题目描述：

代码如下：

public class Solution {
    //统计逆序对的个数
    int count;
    public int InversePairs(int[] array) {
        if (array.length != 0) {
            divide(array, 0, array.length - 1);
        }
        return count;
    }
    private void divide(int[] arr, int start, int end) {
        if (start < end) {
            int mid = start + (end - start) / 2;
            divide(arr, start, mid);
            divide(arr, mid + 1, end);
            merge(arr, start, mid, end);
        }
    }
    private void merge(int[] arr, int start, int mid, int end) {
        int[] temp = new int[end - start + 1];
        //存一下变量
        int i = start, j = mid + 1, k = 0;
        //下面就开始两两进行比较，若前面的数大于后面的数，就构成逆序对
        while (i <= mid && j <= end) {
            //若前面小于后面，直接存进去，并且移动前面数所在的数组的指针即可
            if (arr[i] <= arr[j]) {
                temp[k++] = arr[i++];
            } else {
                temp[k++] = arr[j++];
                //a[i]>a[j]了，那么这一次，从a[i]开始到a[mid]必定都是大于这个a[j]的，因为此时分治的两边已经是各自有序了
                count = (count + mid - i + 1) % 1000000007;
            }
        }
        while (i <= mid)
            temp[k++] = arr[i++];
        while (j <= end)
            temp[k++] = arr[j++];
        for (k = 0; k < temp.length; k++) {
            arr[start + k] = temp[k];
        }
    }
}