码迷,mamicode.com
首页 > 其他好文 > 详细

303.Range Sum Query(class、self的用法)

时间:2018-10-08 13:29:49      阅读:158      评论:0      收藏:0      [点我收藏+]

标签:sel   obj   cal   hang   nts   hat   led   anti   function   

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:

    def __init__(self, nums):
        """
        :type nums: List[int]
        """
        self.nums = nums
        if len(nums):
            self.list = [nums[0]]
            for i in range(1,len(nums)):
                self.list.append(self.list[i-1]+nums[i])

    def sumRange(self, i, j):
        """
        :type i: int
        :type j: int
        :rtype: int
        """
        return self.list[j]-self.list[i]+self.nums[i]
        


# Your NumArray object will be instantiated and called as such:
# obj = NumArray(nums)
# param_1 = obj.sumRange(i,j)

303.Range Sum Query(class、self的用法)

标签:sel   obj   cal   hang   nts   hat   led   anti   function   

原文地址:https://www.cnblogs.com/bernieloveslife/p/9750593.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!