标签:def col return array tco numa and style span
给定一个整数数组 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): """ :type nums: List[int] """ self.data=nums def sumRange(self, i, j): """ :type i: int :type j: int :rtype: int """ return sum(self.data[i:j+1]) # Your NumArray object will be instantiated and called as such: # obj = NumArray(nums) # param_1 = obj.sumRange(i,j)
【leetcode 简单】 第七十九题 区域和检索 - 数组不可变
标签:def col return array tco numa and style span
原文地址:https://www.cnblogs.com/flashBoxer/p/9532424.html