package com.fishercoder.solutions;

/**
 * 303. Range Sum Query - Immutable
 * Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive.

 Example:
 Given nums = [-2, 0, 3, -5, 2, -1]

 sumRange(0, 2) -> 1
 sumRange(2, 5) -> -1
 sumRange(0, 5) -> -3

 Note:
 You may assume that the array does not change.
 There are many calls to sumRange function.
 */
public class _303 {
    public static class NumArray {
        int[] sums;

        public NumArray(int[] nums) {
            sums = new int[nums.length];
            for (int i = 0; i < nums.length; i++) {
                if (i == 0) {
                    sums[i] = nums[i];
                } else {
                    sums[i] = sums[i - 1] + nums[i];
                }
            }
        }

        public int sumRange(int i, int j) {
            if (i == 0) {
                return sums[j];
            }
            return sums[j] - sums[i - 1];
        }
    }
}

// Your NumArray object will be instantiated and called as such:
// NumArray numArray = new NumArray(nums);
// numArray.sumRange(0, 1);
// numArray.sumRange(1, 2);
@@ -33,370 +33,8 @@
 s;%0A%0A
-/**%0A * 303. Range Sum Query - Immutable%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 Example:%0A Given nums = %5B-2, 0, 3, -5, 2, -1%5D%0A%0A sumRange(0, 2) -%3E 1%0A sumRange(2, 5) -%3E -1%0A sumRange(0, 5) -%3E -3%0A%0A Note:%0A You may assume that the array does not change.%0A There are many calls to sumRange function.%0A */%0A
 publ

refactor 303