Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive.
给定一个整形数组,求出元素i,j之间所有元素的和。
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.
代码如下:
class NumArray(object):
def __init__(self,num):
self.num=num
def sumRange(self,i,j):
sum=0
while(i<=j):
sum+=self.num[i]
i=i+1
print(sum)
num1=NumArray([-2,0,3,-5,2,-1])
num1.sumRange(1,2)
num1.sumRange(0,4)
第一次做leetcode题,测试结果超时,还未解决。
问题是题目说多次调用sumRange函数,时间复杂度o(n*n)
利用数组保存每一个list不同长度部分的和,计算时直接调用数组的值就可以,用空间换时间。
class NumArray(object):
def __init__(self, nums):
"""
initialize your data structure here.
:type nums: List[int]
"""
size = len(nums)
self.sums = [0] * (size + 1)
for x in range(size):
self.sums[x + 1] = self.sums[x] + nums[x]
def sumRange(self, i, j):
"""
sum of elements nums[i..j], inclusive.
:type i: int
:type j: int
:rtype: int
"""
return self.sums[j + 1] - self.sums[i]
self.sums = [0] * (size + 1)这一行的意思是给sums数组初始化。如果size是5,表示代求数组有5个元素。则sums数组有6个元素,其中sums[0]=0。其他5个值在下面被赋值,分别是每一部分的和。