leetcode 303

最新推荐文章于 2022-12-07 04:59:12 发布

Stepfen Shawn

最新推荐文章于 2022-12-07 04:59:12 发布

阅读量99

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/qq_43933657/article/details/108066570

版权

leetcode 专栏收录该内容

17 篇文章 0 订阅

订阅专栏

连接:
https://leetcode-cn.com/problems/range-sum-query-immutable/comments/

class NumArray:

    def __init__(self, nums: List[int]):
        if not nums:
            return
        self.dp = [0] * len(nums)
        self.dp[0] = nums[0]
        # 求和
        # 转移方程: dp[i] = dp[i-1] + nums[i]
        for i in range(1,len(nums)):
            self.dp[i] = self.dp[i-1] + nums[i]

    def sumRange(self, i: int, j: int) -> int:
        if i == 0:
            return self.dp[j]
        else:
            return self.dp[j] - self.dp[i-1]