import java.util.*; public class Solution { private int count = 0;//定义数量 public int InversePairs(int[] nums) { int n = nums.length; if (n == 1) { return 0; } //归并排序 mergeSort(nums, 0, n - 1); return count; } private void m...