题目:
我的思路:一开始拿到肯定是针对i和j进行区间的计算sum,但是很明显会超时,因为题目中明确提到多次调用这个函数,因此换个思路,将计算前n项的和放在一个数组中
代码
class NumArray {
int[] arr;
public NumArray(int[] nums) {
arr = new int[nums.length];
int sum = 0;
for(int i=0;i<nums.length;i++){
sum += nums[i];
arr[i] = sum;
}
}
public int sumRange(int i, int j) {
if(i == 0)
return arr[j];
return arr[j] - arr[i-1];
}
}
/**
* Your NumArray object will be instantiated and called as such:
* NumArray obj = new NumArray(nums);
* int param_1 = obj.sumRange(i,j);
*/
排名较高的代码
思路差不多
class NumArray {
int[] nums;
public NumArray(int[] nums) {
this.nums = new int[nums.length];
if(this.nums.length == 0) return;
this.nums[0] = nums[0];
for(int i=1; i<nums.length;i++) {
this.nums[i] = this.nums[i-1] + nums[i];
}
}
public int sumRange(int i, int j) {
return i==0? nums[j]:nums[j]-nums[i-1];
}
}