解题思路
归并排序
例如:
- 对于序列1,2,3,4,5,6,7,0,逆序对有(1,0),(2,0),(3,0),(4,0),(5,0),(6,0),(7,0),总数量为7
- 对于序列1,3,4,2,逆序对有(4,2)(3,2),总数量为2.
- 对于序列2,4,3,1,逆序对有(2,1),(4,3),(4,1),(3,1),总数量为4.
python 代码
# -*- coding:utf-8 -*-
class Solution:
def __init__(self):
self.count = 0
def InversePairs(self, data):
# write code here
self.MergeSort(data)
return self.count%1000000007
def MergeSort(self,lists):
#global count
if len(lists) <= 1:
return lists
num = int( len(lists)/2 )
left = self.MergeSort(lists[:num])
right = self.MergeSort(lists[num:])
r, l=0, 0
result=[]
while l<len(left) and r<len(right):
if left[l] < right[r]:
result.append(left[l])
l += 1
else:
result.append(right[r])
r += 1
self.count += len(left)-l
result += right[r:]
result += left[l:]
return result
s = Solution()
result = s.InversePairs([1,2,3,4,5,6,7,0])
print(result) # 7