标签:div print amp list else lin mon padding query
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:
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]
303. Range Sum Query - Immutable 数组范围求和 - 不变
标签:div print amp list else lin mon padding query
原文地址:http://www.cnblogs.com/xiejunzhao/p/7266230.html