数组中的逆序对

private static long cnt = 0;
private static int[] temp;
public static int InversePairs(int[] array){
    temp = new int[array.length];
    mergeSort(array, 0, array.length - 1);
    return cnt;
}
private static void mergeSort(int[] nums, int l, int h){
    if (h - l < 1){
        return;
    }
    int m = l + (h - l) / 2;
    mergeSort(nums, l, m);
    mergeSort(nums, m + 1, h);
    merge(nums, l, m, h);
}
private static void merge(int[] nums, int l, int m, int h){
    int i = l;
    int j = m + 1;
    int k = l;
    while (i <= m || j <= h){
        if (i > m){
            temp[k] = nums[j++];
        }else if (j > h){
            temp[k] = nums[i++];
        }else if (nums[i] < nums[j]){
            temp[k] = nums[i++];
        }else{
            temp[k] = nums[j++];
            cnt += m - i + 1;
        }
        k++;
    }
    for (k = l; k <= h; k++){
        nums[k] = temp[k];
    }
}