题目
给定一个整数数组 nums,求出数组从索引 i 到 j(i ≤ j)范围内元素的总和,包含 i、j 两点。
实现 NumArray 类:
NumArray(int[] nums) 使用数组 nums 初始化对象
int sumRange(int i, int j) 返回数组 nums 从索引 i 到 j(i ≤ j)范围内元素的总和,包含 i、j 两点(也就是 sum(nums[i], nums[i + 1], … , nums[j]))
示例
输入:
[“NumArray”, “sumRange”, “sumRange”, “sumRange”]
[[[-2, 0, 3, -5, 2, -1]], [0, 2], [2, 5], [0, 5]]
输出:
[null, 1, -1, -3]
解释:
NumArray numArray = new NumArray([-2, 0, 3, -5, 2, -1]);
numArray.sumRange(0, 2); // return 1 ((-2) + 0 + 3)
numArray.sumRange(2, 5); // return -1 (3 + (-5) + 2 + (-1))
numArray.sumRange(0, 5); // return -3 ((-2) + 0 + 3 + (-5) + 2 + (-1))
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/range-sum-query-immutable
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
想法
1、preSum 前缀和:
假设数组长度nums为 N,定义一个长度为 N+1 的 preSum 数组
preSum[i] 表示该元素左边所有元素之和(不包含 i 元素)
2、求索引 i 到 j 的
sum(i, j) = preSum[ j + 1 ] - preSum[ i ]
3、
class Student:
def __init__(self):#两者之间的区别
self.name = None
self.score = None
def __init__(self, name, score):
self.name = name
self.score = score
代码
class NumArray:
def __init__(self, nums: List[int]):
n=len(nums)
self.preSum=[0]*(n+1)
for i in range(1,n+1):
self.preSum[i] = self.preSum[i-1]+nums[i-1]
def sumRange(self, left: int, right: int) -> int:
return self.preSum[right+1]-self.preSum[left]
# Your NumArray object will be instantiated and called as such:
# obj = NumArray(nums)
# param_1 = obj.sumRange(left,right)
方法2:java
class NumArray {
int[] sums;
public NumArray(int[] nums) {
int n = nums.length;
sums = new int[n + 1];
for (int i = 0; i < n; i++) {
sums[i + 1] = sums[i] + nums[i];
}
}
public int sumRange(int i, int j) {
return sums[j + 1] - sums[i];
}
}