303. Range Sum Query - Immutable

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.

解法

这道题看上去非常简单，求哪里就从哪里开始累加即可，但是在提示中说，给定的数组不变，但是会多次查询sunRange函数，也就是说会多次调用sumRange函数，所以就需要做一些预处理，来简化程序时间。
sum[i,j]=sum[j]-sum[i-1]

class NumArray {
    private int [] sum;

    public NumArray(int[] nums) {
        sum = new int[nums.length+1];
        for(int i=0;i<nums.length;i++)
        {
            sum[i+1]=sum[i]+nums[i];
            
        }
    }
    
    public int sumRange(int i, int j) {
       return sum[j+1]-sum[i];
    }
}

/**
 * Your NumArray object will be instantiated and called as such:
 * NumArray obj = new NumArray(nums);
 * int param_1 = obj.sumRange(i,j);
 */