1508. Range Sum of Sorted Subarray Sums Medium

1/**
2 * [1508] Range Sum of Sorted Subarray Sums
3 *
4 * You are given the array nums consisting of n positive integers. You computed the sum of all non-empty continuous subarrays from the array and then sorted them in non-decreasing order, creating a new array of n * (n + 1) / 2 numbers.
5 * Return the sum of the numbers from index left to index right (indexed from 1), inclusive, in the new array. Since the answer can be a huge number return it modulo 10^9 + 7.
6 *  
7 * Example 1:
8 * 
9 * Input: nums = [1,2,3,4], n = 4, left = 1, right = 5
10 * Output: 13 
11 * Explanation: All subarray sums are 1, 3, 6, 10, 2, 5, 9, 3, 7, 4. After sorting them in non-decreasing order we have the new array [1, 2, 3, 3, 4, 5, 6, 7, 9, 10]. The sum of the numbers from index le = 1 to ri = 5 is 1 + 2 + 3 + 3 + 4 = 13. 
12 * 
13 * Example 2:
14 * 
15 * Input: nums = [1,2,3,4], n = 4, left = 3, right = 4
16 * Output: 6
17 * Explanation: The given array is the same as example 1. We have the new array [1, 2, 3, 3, 4, 5, 6, 7, 9, 10]. The sum of the numbers from index le = 3 to ri = 4 is 3 + 3 = 6.
18 * 
19 * Example 3:
20 * 
21 * Input: nums = [1,2,3,4], n = 4, left = 1, right = 10
22 * Output: 50
23 * 
24 *  
25 * Constraints:
26 * 
27 * 	n == nums.length
28 * 	1 <= nums.length <= 1000
29 * 	1 <= nums[i] <= 100
30 * 	1 <= left <= right <= n * (n + 1) / 2
31 * 
32 */
33pub struct Solution {}
34
35// problem: https://leetcode.com/problems/range-sum-of-sorted-subarray-sums/
36// discuss: https://leetcode.com/problems/range-sum-of-sorted-subarray-sums/discuss/?currentPage=1&orderBy=most_votes&query=
37
38// submission codes start here
39
40impl Solution {
41    pub fn range_sum(nums: Vec<i32>, n: i32, left: i32, right: i32) -> i32 {
42        0
43    }
44}
45
46// submission codes end
47
48#[cfg(test)]
49mod tests {
50    use super::*;
51
52    #[test]
53    fn test_1508() {
54    }
55}
56