数组中的逆序对

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

public class Solution {
    public int InversePairs(int [] array) {
        if(array.length == 0)
            return 0;
        int [] copy = new int [array.length];
        return InversePairsMerge(array, copy, 0, array.length - 1);
    }
    public int InversePairsMerge(int [] arr, int [] copy, int start, int end){
        if(start == end)
            return 0;
        int mid = (end - start)/2 + start;
        int count = 0;
        count += InversePairsMerge(arr, copy, start, mid);
        count += InversePairsMerge(arr, copy, mid+1, end);
        return (mergeCount(arr, copy, start, mid, end) + count)%1000000007;
    }
    private int mergeCount(int [] arr, int [] copy, int start, int mid, int end){
        int lastPos = end;
        int midPos = mid;
        int currPos = end;
        int count = 0;
        while(midPos >= start && lastPos > mid){
            if(arr[midPos] > arr[lastPos]){
                count += (lastPos - mid);
                if(count > 1000000007)
                    count %= 1000000007;
                copy[currPos--] = arr[midPos--];
            }else
                copy[currPos--] = arr[lastPos--];
        }
        while(midPos >= start)
            copy[currPos--] = arr[midPos--];
        while(lastPos > mid)
            copy[currPos--] = arr[lastPos--];
        while(start <= end){
            arr[start] = copy[start];
            start++;
        }
        return count%1000000007;
    }
}