首页 > itarticle > [leetcode] problem 303 – range sum query – immutable

[leetcode] problem 303 – range sum query – immutable

admin 11月 13, 2020 0

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.

Code

private int[] sum;

public (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];
}