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.
思路:Prefix 模板,Sum[i, j] = prefixsum[j + 1] - prefixsum[i];
class NumArray {
private int[] prefixsum;
public NumArray(int[] nums) {
int n = nums.length;
this.prefixsum = new int[n + 1];
for(int i = 1; i <= n; i++) {
prefixsum[i] = prefixsum[i - 1] + nums[i - 1];
}
}
public int sumRange(int i, int j) {
return prefixsum[j + 1] - prefixsum[i];
}
}
/**
* Your NumArray object will be instantiated and called as such:
* NumArray obj = new NumArray(nums);
* int param_1 = obj.sumRange(i,j);
*/