原题地址:https://leetcode-cn.com/problems/shu-zu-zhong-de-ni-xu-dui-lcof/
题目描述:
在数组中的两个数字,如果前面一个数字大于后面的数字,则这两个数字组成一个逆序对。输入一个数组,求出这个数组中的逆序对的总数。
示例 1:
输入: [7,5,6,4]
输出: 5
限制:
0 <= 数组长度 <= 50000
解题方案:
代码:
class Solution {
public int reversePairs(int[] nums) {
int len = nums.length;
if(len <= 1) return 0;
int[] temp = new int[len];
return getPairs(0, len - 1, nums, temp);
}
public int getPairs(int left, int right, int[] nums, int[] temp)
{
if(left == right) return 0;
int mid = (left + right) / 2;
int pair1 = getPairs(left, mid, nums, temp) + getPairs(mid + 1, right, nums, temp);
if(nums[mid] <= nums[mid + 1])
return pair1;
int pair2 = merge(left, right, mid, nums, temp);
return pair1 + pair2;
}
public int merge(int left, int right, int mid, int[] nums, int[] temp)
{
for(int i = left; i <= right; i ++)
temp[i] = nums[i];
int i = left, j = mid + 1, k = left, count = 0;
while(i <= mid && j <= right)
{
if(temp[i] <= temp[j])
nums[k ++] = temp[i ++];
else
{
nums[k ++] = temp[j ++];
count += mid - i + 1;
}
}
while(j <= right)
nums[k ++] = temp[j ++];
while(i <= mid)
nums[k ++] = temp[i ++];
return count;
}
}