@@ -0,0 +1,990 @@
+/**%0A * Given an integer array nums, find the sum of the elements between indices i and j (i %E2%89%A4 j), inclusive.%0A **/%0A%0Apublic class NumArray %7B%0A    private int%5B%5D sumArray; // sumArray%5Bi%5D is the sum from sum%5B0%5D to sum%5Bi-1%5D%0A    %0A    public NumArray(int%5B%5D nums) %7B%0A        sumArray = new int%5Bnums.length + 1%5D;%0A        if(nums == null %7C%7C nums.length == 0)%0A            return;%0A        sumArray%5B0%5D = 0;%0A        for(int i = 1; i %3C= nums.length; i++)%0A            sumArray%5Bi%5D = sumArray%5Bi-1%5D + nums%5Bi-1%5D;%0A    %7D%0A%0A    public int sumRange(int i, int j) %7B%0A        if(i %3E j %7C%7C i %3C 0 %7C%7C j %3E sumArray.length) %0A            return 0;%0A        return sumArray%5Bj+1%5D - sumArray%5Bi%5D;%0A    %7D%0A%0A    public static void main(String%5B%5D args) %7B%0A        int%5B%5D anArray = %7B-2, 0, 3, -5, 2, -1%7D;%0A        NumArray na = new NumArray(anArray);%0A        System.out.println(na.sumRange(0,1));%0A        System.out.println(na.sumRange(1,2));%0A        System.out.println(na.sumRange(1,5));%0A        System.out.println(na.sumRange(5,5));%0A    %7D%0A%7D%0A

Create 303.java