LeetCode [303. Range Sum Query - Immutable]

最新推荐文章于 2024-08-07 08:23:35 发布

爱你多过爱自己

最新推荐文章于 2024-08-07 08:23:35 发布

阅读量154

点赞数

分类专栏： leecode 文章标签： leetcode

本文链接：https://blog.csdn.net/a1042651820/article/details/78449786

版权

leecode 专栏收录该内容

29 篇文章 0 订阅

订阅专栏

Problem：303. Range Sum Query - Immutable

Question

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.

思路

有三种思路

1.每次调用循环累加求加

sum(i,j)

2.缓存每次调用结果，如果多次重复调用，直接拿来使用

caching
hash(range, result)

3.也是缓存，算是动态规划吧

sum(i) = 前i-1项的和
sum(i,j) = sum(j+1) - sum(i)

代码

#define SIZE 100000
class NumArray {
public:
    int sum[SIZE];
    NumArray(vector<int> nums) {
        sum[0] = 0;
        for (int i = 1; i <= nums.size(); i++)
            sum[i] = nums[i-1] + sum[i-1];
    }

    int sumRange(int i, int j) {
        return sum[j+1] - sum[i];
    }
};

/**
 * Your NumArray object will be instantiated and called as such:
 * NumArray obj = new NumArray(nums);
 * int param_1 = obj.sumRange(i,j);
 */