[LeetCode] Range Sum Query - Immutable 区域和检索 - 不可变
Given an integer array nums, find the sum of the elements between indices iand 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.
这道题让我们检索一个数组的某个区间的所有数字之和,题目中给了两条条件,首先数组内容不会变化,其次有很多的区间和检索。那么我们用传统的遍历相加来求每次区间和检索,十分的不高效,而且无法通过 OJ。所以这道题的难点就在于是否能想到来用建立累计直方图的思想来建立一个累计和的数组 dp,其中 dp[i] 表示 [0, i] 区间的数字之和,那么 [i,j] 就可以表示为 dp[j]-dp[i-1],这里要注意一下当 i=0 时,直接返回 dp[j] 即可,参见代码如下:
哈皮解法:
class NumArray {
private int[] nums;
public NumArray(int[] nums) {
this.nums = nums;
}
public int sumRange(int i, int j) {
int sum = 0;
for(int z=i; z<= j; z++){
sum += nums[z];
}
return sum;
}
}
/**
* Your NumArray object will be instantiated and called as such:
* NumArray obj = new NumArray(nums);
* int param_1 = obj.sumRange(i,j);
*/
标准解法
注意就是这里把for循环初始化放到构造函数里面了, 之前太捞了没想到这么做,然后dp = nums 那么第一个值就不用管了。毕竟不用加,直接从第二个开始算就行
class NumArray {
private int[] dp;
public NumArray(int[] nums) {
this.dp= nums;
for(int i = 1; i < dp.length; i++)
dp[i] += dp[i -1];
}
public int sumRange(int i, int j) {
return i == 0 ? dp[j] : dp[j] - dp[i -1];
}
}
第二次
class NumArray {
private int[] result;
public NumArray(int[] nums) {
result = new int[nums.length];
if(nums.length > 0){
result[0] = nums[0];
for(int i = 1; i < nums.length; i++)
result[i] = result[i-1] + nums[i];
}
}
public int sumRange(int i, int j) {
return i == 0 ? result[j] : result[j] - result[i-1];
}
}
/**
* Your NumArray object will be instantiated and called as such:
* NumArray obj = new NumArray(nums);
* int param_1 = obj.sumRange(i,j);
*/