归并排序递归版:(便于理解此题)先分后合,分:sort(start,end),合:merge(start,mid,end)代码:public class Solution { private int count; public int InversePairs(int [] array) { if(array==null || array.length==0) return -1; MergeSort(array,0,array.length-1); return count; } private void MergeSort(...