leetCode:493. Reverse Pairs

Given an array nums, we call (i, j) an important reverse pair if i < j and nums[i] > 2*nums[j].

You need to return the number of important reverse pairs in the given array.

解题思路：

1.归并排序

用归并排序将数组从小到大排序，在归并过程中，将数组从前往后，从小到大合并，并用一个索引p记录当前处于前一半归并数组的nums[i]值有多少个后一半数组的nums[j]，使得nums[i]>2*nums[j]，然后在此基础上往后面叠加p，因为对于处于前一半数组的nums[i] <= nums[i']，必有p<=p'。故p的值只需要逐步往后累加。再将各个p值加起来就是所求答案。

class Solution {
public:
    int ans;
    void merge(vector<int>& nums, int L, int R){
        int len = R - L + 1, mid = (L + R)/2;
        int* c = new int[len];
        int i = L, j = mid + 1, k = 0;
        int p = j;
        while(i <= mid){
            while(p <= R && nums[i] > 2LL * nums[p])p++;
            ans += p - mid - 1;
            while(j <= R && nums[i] >= nums[j])c[k++] = nums[j++];
            c[k++] = nums[i++];
        }
        while(j <= R)c[k++] = nums[j++];
        for(i = 0; i < len; i++)nums[i + L] = c[i];
        delete[] c;
    }
    void mergeSort(vector<int>& nums, int L, int R){
        if(L >= R)return;
        int mid = (L + R)/2;
        mergeSort(nums, L, mid);
        mergeSort(nums, mid + 1, R);
        merge(nums, L, R);
    }
    int reversePairs(vector<int>& nums) {
        int len = nums.size();
        ans = 0;
        mergeSort(nums, 0, len - 1);
        /*
        for(int i = 0; i < len; i++)cout << nums[i] << " ";
        cout << endl;
        */
        return ans;
    }
};