Method Solution

493. Reverse Pairs/Solution.cpp:16–16

    int rev_pair;
    vector<int> n;
    Solution():rev_pair(0) {}

    void mergeSort(int l, int r) {
        if (l + 1 >= r) return;     // zero or one element