数据结构与算法(Java) 6：归并排序应用[逆序对问题]

逆序对问题 在一个数组中，左边的数如果比右边的数大，则折两个数构成一个逆序对，请打印所有逆序对。

类似于小和问题，此题只要将归并排序转换为由大至小排序，找出L部分大于R部分的数即可。

package section1;

import java.util.Arrays;

public class ReversePair {
    public static int reversePair(int[] arr){
        if (arr == null || arr.length < 2) return 0;
        return mergeSort(arr, 0, arr.length-1);
    }

    public static int mergeSort(int[] arr, int L, int R){
        if (L == R) return 0;
        int mid = L + (R - L) / 2;
        return mergeSort(arr, L, mid) + mergeSort(arr, mid + 1, R) + merge(arr, L, R, mid);
    }

    public static int merge(int[] arr, int L, int R, int mid){
        int[] flag = new int[R - L + 1];
        int p1 = L;
        int p2 = mid + 1;
        int pair = 0;
        int i = 0;
        while (p1 <= mid && p2 <= R){
            pair += arr[p1] > arr[p2] ? (R - p2 +1) : 0;
            flag[i++] = arr[p1] > arr[p2] ? arr[p1++] : arr[p2++];
        }
        while (p1 <= mid){
            flag[i++] = arr[p1++];
        }
        while (p2 <= R){
            flag[i++] = arr[p2++];
        }
        for (int j = 0; j < flag.length; j++){
            arr[L + j] = flag[j];
        }
        return pair;
    }

    // for test
    public static int comparator(int[] arr) {
        if (arr == null || arr.length < 2) {
            return 0;
        }
        int res = 0;
        for (int i = 1; i < arr.length; i++) {
            for (int j = 0; j < i; j++) {
                res += arr[j] > arr[i] ? 1 : 0;
            }
        }
        return res;
    }

    // for test
    public static int[] generateRandomArray(int maxSize, int maxValue) {
        int[] arr = new int[(int) ((maxSize + 1) * Math.random())];
        for (int i = 0; i < arr.length; i++) {
            arr[i] = (int) (maxValue * Math.random());
        }
        return arr;
    }

    // for test
    public static int[] copyArray(int[] arr) {
        if (arr == null) {
            return null;
        }
        int[] res = new int[arr.length];
        for (int i = 0; i < arr.length; i++) {
            res[i] = arr[i];
        }
        return res;
    }

    // for test
    public static boolean isEqual(int[] arr1, int[] arr2) {
        if ((arr1 == null && arr2 != null) || (arr1 != null && arr2 == null)) {
            return false;
        }
        if (arr1 == null && arr2 == null) {
            return true;
        }
        if (arr1.length != arr2.length) {
            return false;
        }
        for (int i = 0; i < arr1.length; i++) {
            if (arr1[i] != arr2[i]) {
                return false;
            }
        }
        return true;
    }

    // for test
    public static void printArray(int[] arr) {
        if (arr == null) {
            return;
        }
        for (int i = 0; i < arr.length; i++) {
            System.out.print(arr[i] + " ");
        }
        System.out.println();
    }

    // for test
    public static void main(String[] args) {
        int testTime = 500000;
        int maxSize = 100;
        int maxValue = 100;
        boolean succeed = true;
        for (int i = 0; i < testTime; i++) {
            int[] arr1 = generateRandomArray(maxSize, maxValue);
            int[] arr2 = copyArray(arr1);
            if (reversePair(arr1) != comparator(arr2)) {
                succeed = false;
                printArray(arr1);
                printArray(arr2);
                break;
            }
        }
        System.out.println(succeed ? "Nice!" : "Fucking fucked!");
    }
}