add 1508

Author: fishercoder1534

README.md

@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ ★
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|--------|-------------|-------------
+|1508|[Range Sum of Sorted Subarray Sums](https://leetcode.com/problems/range-sum-of-sorted-subarray-sums/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1508.java) | |Medium|Array, Sort|
 |1507|[Reformat Date](https://leetcode.com/problems/reformat-date/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1507.java) | |Easy|String|
 |1502|[Can Make Arithmetic Progression From Sequence](https://leetcode.com/problems/can-make-arithmetic-progression-from-sequence/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1502.java) | |Easy|Array, Sort|
 |1496|[Path Crossing](https://leetcode.com/problems/path-crossing/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1496.java) | |Easy|String|

src/main/java/com/fishercoder/solutions/_1508.java

@@ -0,0 +1,27 @@
+package com.fishercoder.solutions;
+
+import java.util.ArrayList;
+import java.util.Collections;
+import java.util.List;
+
+public class _1508 {
+    public static class Solution1 {
+        public int rangeSum(int[] nums, int n, int left, int right) {
+            List<Long> list = new ArrayList<>();
+            for (int i = 0; i < nums.length; i++) {
+                long sum = nums[i];
+                list.add(sum);
+                for (int j = i + 1; j < nums.length; j++) {
+                    sum += nums[j];
+                    list.add(sum);
+                }
+            }
+            Collections.sort(list);
+            long result = 0;
+            for (int i = left - 1; i < right; i++) {
+                result += list.get(i);
+            }
+            return (int) result % 1000000007;
+        }
+    }
+}

src/test/java/com/fishercoder/_1508Test.java

@@ -0,0 +1,22 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1508;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static junit.framework.TestCase.assertEquals;
+
+public class _1508Test {
+    private static _1508.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1508.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(13, solution1.rangeSum(new int[]{1, 2, 3, 4}, 4, 1, 5));
+    }
+
+}