首页 > 代码库 > 303. Range Sum Query - Immutable 数组范围求和 - 不变
303. Range Sum Query - Immutable 数组范围求和 - 不变
Given an integer array nums, find the sum of the elements between indices i and 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.
class NumArray(object):
summations = []
def __init__(self, nums):
"""
:type nums: List[int]
"""
self.summations = []
curSum = 0
for i in nums:
curSum = curSum + i
self.summations.append(curSum)
def sumRange(self, i, j):
"""
:type i: int
:type j: int
:rtype: int
"""
if i is 0:
return self.summations[j]
else:
return self.summations[j] - self.summations[i-1]
来自为知笔记(Wiz)
303. Range Sum Query - Immutable 数组范围求和 - 不变
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。