-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy path1508-RangeSumOfSortedSubarraySums.cs
41 lines (36 loc) · 1.06 KB
/
1508-RangeSumOfSortedSubarraySums.cs
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
//-----------------------------------------------------------------------------
// Runtime: 388ms
// Memory Usage: 30.3 MB
// Link: https://leetcode.com/submissions/detail/368563284/
//-----------------------------------------------------------------------------
using System;
namespace LeetCode
{
public class _1508_RangeSumOfSortedSubarraySums
{
public int RangeSum(int[] nums, int n, int left, int right)
{
var size = n * (n + 1) / 2;
var arr = new int[size];
var index = 0;
for (int i = 0; i < n; i++)
{
var temp = 0;
for (int j = i; j < n; j++)
{
temp += nums[j];
arr[index++] = temp;
}
}
Array.Sort(arr);
var mod = 1000000007;
var result = 0;
for (int i = left - 1; i < right; i++)
{
result += arr[i] % mod;
result %= mod;
}
return result;
}
}
}