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.
根据题意,由于存在多次调用,所以对于每一次调用都去遍历求和,无疑会超时。所以需要存储结果,在构造函数中完成结果的存储,之后每次调用只需要查结果即可。首先想到的使用矩阵存储,m[i][j]为sumRange(i,j)的值。但是这种方法也超时了,因为构造时间太长。
更适合的方法是用一个数组sums,sum[j]存储sumRange(0,j),则有sumRange(i,j)=sum[j]-sum[i-1]。
具体代码如下:
int[] sums;
public NumArray(int[] nums) {
if(nums==null||nums.length==0)
sums=null;
else{
sums=new int[nums.length];
sums[0]=nums[0];
for(int i=1;i<nums.length;i++){
sums[i]=sums[i-1]+nums[i];
}
}
}
public int sumRange(int i, int j) {
if(sums==null||i>=sums.length||j>=sums.length||i>j){
return 0;
}else{
if(i==0)
return sums[j];
else
return sums[j]-sums[i-1];
}
}
public NumArray(int[] nums) {
if(nums==null||nums.length==0)
sums=null;
else{
sums=new int[nums.length];
sums[0]=nums[0];
for(int i=1;i<nums.length;i++){
sums[i]=sums[i-1]+nums[i];
}
}
}
public int sumRange(int i, int j) {
if(sums==null||i>=sums.length||j>=sums.length||i>j){
return 0;
}else{
if(i==0)
return sums[j];
else
return sums[j]-sums[i-1];
}
}