C++版本: 本质上是归并排序的拓展,merge的时候,后<前,则逆序对数量+=前剩下的所有数(M-P1+1) class Solution { public: int inverseCount = 0; void merge(vector& data, int L, int M, int R) { vector help(R - L + 1,0); int p1 = L, p2 = M + 1; int i = 0; while (p1 <= M && p2 <= R) { if (data[p2] < data[p1]) { inverseC...