Range Sum Query - Immutable

最新推荐文章于 2024-12-03 10:03:39 发布

躲不过这哀伤

最新推荐文章于 2024-12-03 10:03:39 发布

阅读量52

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/agentgamer/p/6241293.html

本文介绍了一种使用缓存来解决LeetCode上范围求和问题的方法。通过预先计算并存储子数组的累积和，可以高效地计算任意区间的元素之和。此方法大大提升了查询效率。

https://leetcode.com/problems/range-sum-query-immutable/

用缓存撒

/**
 * @constructor
 * @param {number[]} nums
 */
var NumArray = function(nums) {
    this.nums = nums;
    this.cache = [];
    var acc = 0;
    for (var i = 0; i < nums.length; i++) {
        acc += nums[i];
        this.cache.push(acc);
    }
};

/**
 * @param {number} i
 * @param {number} j
 * @return {number}
 */
NumArray.prototype.sumRange = function(i, j) {
    if (this.cache.length === 0) return 0;
    return this.cache[j] - this.cache[i] + this.nums[i];
};


/**
 * Your NumArray object will be instantiated and called as such:
 * var numArray = new NumArray(nums);
 * numArray.sumRange(0, 1);
 * numArray.sumRange(0, 2);
 */