leetcode-5445- 子数组和排序后的区间和

题目描述：

 

 提交：

class Solution:
    def rangeSum(self, nums: List[int], n: int, left: int, right: int) -> int:
        l = []
        for i in range(n):
            for j in range(i+1,n+1):
                l.append(sum(nums[i:j]))
        l.sort()
        print(l)
        return sum(l[left-1:right]) % (10**9 + 7)