python 小和问题和逆序对问题

小和问题：在一个数组中， 每一个数左边比当前数小的数累加起来， 叫做这个数组的小和。 求一个数组的小和。

def smallsum(arr, l, r):
    if l == r:
        return 0
    mid = (l + r) >> 1
    return smallsum(arr, l, mid) + smallsum(arr, mid + 1, r) + merge(arr, l, mid, r)

def merge(arr, start, mid, end):
    l, r = start, mid+1
    result = []
    sum = 0

    while l <= mid and r <= end:
        if arr[l] < arr[r]:
            sum += arr[l] * (end - r + 1)
            result.append(arr[l])
            l += 1
        else:
            result.append(arr[r])
            r += 1

    while l <= mid:
        result.append(arr[l])
        l += 1
    while r <= end:
        result.append(arr[r])
        r += 1
    for i in range(len(result)):
        arr[start+i] = result[i]
    return sum

if __name__ == '__main__':
    list1 = [1, 4, 3, 2, 5]
    a = smallsum(list1,0 ,len(list1)-1)
    print(a)

逆序对问题： 在数组中的两个数字，如果前面一个数字大于后面的数字，则这两个数字组成一个逆序对。输入一个数组，求出这个数组中的逆序对的总数。

def ReversePair(list1, l, r):
    if l==r:
        return 0
    mid = (l + r) >> 1
    left = ReversePair(list1, l, mid)
    right = ReversePair(list1, mid + 1, r)
    return left + right + merge(list1, l, mid, r)

def merge(list1, start, mid, end):
    l, r = start, mid + 1
    Sum = 0
    result = []
    while l <= mid and r <= end:
        if list1[l] > list1[r]:
            Sum += 1*(end - r+1)
            print("逆序对为",list1[l],list1[r:end+1])
            result.append(list1[l])
            l += 1
        else:
            result.append(list1[r])
            r += 1

    while l <= mid:
        result.append(list1[l])
        l += 1
    while r <= end:
        result.append(list1[r])
        r += 1

    for i in range(len(result)):
        list1[i+start] = result[i]

    return Sum

if __name__ == '__main__':
    list1 = [7, 5, 6, 4]
    # list1 = [2,4,3,5,1]
    a = ReversePair(list1,0,len(list1)-1)
    # print(list1)
    print("逆序对总数为：",a)