题目描述
给定一个整数数组 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
思路
代码
class NumArray:
def __init__(self,nums):
if not nums:
return 0
n = len(nums)
self.dp = [0]*(n+1)
self.dp[1] = nums[0]
for i in range(2,n+1):
self.dp[i] = self.dp[i-1] + nums[i-1]
def sumRange(self,i,j):
print(self.dp)
print(self.dp[j+1])
print(self.dp[i])
return self.dp[j+1] - self.dp[i]
array = NumArray([-2, 0, 3, -5, 2, -1])
test = array.sumRange(2,5)
print(test)