剑指Offer 数组中的逆序对

/**
 * 数组中的逆序对
 *
 * 在数组中的两个数字，如果前面一个数字大于后面的数字，则这两个数字组成一个逆序对。输入一个数组,求出这个数组中的逆序对的总数P。
 * 并将P对1000000007取模的结果输出。 即输出P%1000000007
 */
public class JZ035InversePairs {

    public static int InversePairs(int [] array) {

        if (array == null || array.length <= 0) {
            return 0;
        }

        int[] tmp = new int[array.length];
        for (int i = 0; i < array.length; i++) {
            tmp[i] = array[i];
        }

        return InversePairsCore(array, tmp, 0, array.length - 1);
    }

    private static int InversePairsCore(int[] array, int[] copy, int low, int high) {

        if (low == high) {
            return 0;
        }

        int mid = (low + high) >> 1;
        int leftCount = InversePairsCore(array, copy, low, mid);
        int rightCount = InversePairsCore(array, copy, mid + 1, high);
        int i = mid;
        int j = high;
        int k = high;
        int count = 0;

        while (i >= low && j > mid) {
            if (array[i] > array[j]) {
                copy[k--] = array[i--];
                count += j - mid;
                if (count >= 1000000007) {
                    count %= 1000000007;
                }
            } else {
                copy[k--] = array[j--];
            }
        }
        while (i >= low) {
            copy[k--] = array[i--];
        }
        while (j > mid) {
            copy[k--] = array[j--];
        }

        for (int x = low; x <= high; x++) {
            array[x] = copy[x];
        }

        return (leftCount + rightCount + count) % 1000000007;
    }

    public static void main(String[] args) {
        int[] a = {7,3,2,4};
        System.out.println(InversePairs(a));
    }
    
    /*
    数组中的逆序对:
    总结：
        归并排序
     */


}