题目描述
在数组中的两个数字,如果前面一个数字大于后面的数字,则这两个数字组成一个逆序对。输入一个数组,求出这个数组中的逆序对的总数P。
思路:把数组分成两个子数组,统计出子数组内部的逆序对,然后再统计出两个相邻子数组之间的逆序对。再统计逆序对的过程中,还要对数组进行排序。参考归并排序的思路。注意一定要深拷贝!!
# -*- coding:utf-8 -*-
import copy
class Solution:
def InversePairs(self, data):
# write code here
if not data:
return 0
tmp = copy.deepcopy(data)
count = self.InversePairsCore(data, tmp, 0, len(data)-1)%1000000007
return count
def InversePairsCore(self, data, tmp, start, end):
if end-start<1:
return 0
#排序
if end-start == 1:
if data[start] <= data[end]:
return 0
else:
tmp[start], tmp[end] = data[end], data[start]
return 1
mid = (end+start)//2
cnt = self.InversePairsCore(tmp, data, start, mid) + self.InversePairsCore(tmp, data, mid+1, end)
i = start
j = mid+1
index = start
while i<=mid and j<=end:
if data[i]<=data[j]:
tmp[index] = data[i]
i+=1
else:
tmp[index] = data[j]
cnt+=mid-i+1
j+=1
index+=1
while i<=mid:
tmp[index] = data[i]
i+=1
index+=1
while j<=end:
tmp[index] = data[j]
j+=1
index+=1
return cnt