给定一个整数数组 nums,求出数组从索引 i 到 j (i ≤ j) 范围内元素的总和,包含 i, j 两点。
示例:
给定 nums = [-2, 0, 3, -5, 2, -1],求和函数为 sumRange()
sumRange(0, 2) -> 1
sumRange(2, 5) -> -1
sumRange(0, 5) -> -3
说明:
你可以假设数组不可变。
会多次调用 sumRange 方法。
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/range-sum-query-immutable
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
解:
算出前缀和
Java
class NumArray {
public int[] sum;//存储前缀和
public NumArray(int[] nums) {
if(nums.length == 0) return;
sum = new int[nums.length];
sum[0] = nums[0];
for(int i = 1; i < nums.length; i++) {
sum[i] = sum[i - 1] + nums[i];
}
}
public int sumRange(int i, int j) {
if(i == 0) return sum[j];
return sum[j] - sum[i - 1];
}
}
/**
* Your NumArray object will be instantiated and called as such:
* NumArray obj = new NumArray(nums);
* int param_1 = obj.sumRange(i,j);
*/
python
class NumArray:
sum
def __init__(self, nums: List[int]):
if(len(nums) == 0):
return
global sum
sum = [0]*len(nums)
sum[0] = nums[0]
for i in range(1,len(nums)):
sum[i] = sum[i-1] + nums[i]
def sumRange(self,i: int, j: int) -> int:
if i - 1 >= 0:
k = sum[i-1]
else:
k = 0
return sum[j] - k
# Your NumArray object will be instantiated and called as such:
# obj = NumArray(nums)
# param_1 = obj.sumRange(i,j)