问题描述:
解题思路:
采用前缀和数组。初始化时,新建一个前缀和数组,用来保存数组第位置的前缀和,查询时,直接用前缀数组和数组高位-前缀数组和数组低位,就可以得到区间数组和。
题解:
class NumArray {
private int[]sum;
public NumArray(int[] nums) {
sum = new int[nums.length+1];
for(int i = 1;i<sum.length;i++){
sum[i] = sum[i-1]+nums[i-1];
}
}
public int sumRange(int left, int right) {
return sum[right+1]-sum[left];
}
}
/**
* Your NumArray object will be instantiated and called as such:
* NumArray obj = new NumArray(nums);
* int param_1 = obj.sumRange(left,right);
*/