LeetCode-303. Range Sum Query - Immutable [C++][Java]

最新推荐文章于 2024-11-11 20:59:17 发布

贫道绝缘子

最新推荐文章于 2024-11-11 20:59:17 发布

阅读量289

点赞数

分类专栏： LeetCode刷题怪文章标签： leetcode

本文链接：https://blog.csdn.net/qq_15711195/article/details/124461184

版权

LeetCode刷题怪专栏收录该内容

230 篇文章 3 订阅

订阅专栏

本文解析了如何使用C++和Java实现LeetCode题目303，即NumArray类的高效计算范围和功能。介绍了如何利用前缀和(psum)数组来快速计算区间和，适用于多次查询的场景。实例演示了初始化、查询操作以及相关约束条件。

摘要由CSDN通过智能技术生成

LeetCode-303. Range Sum Query - Immutablehttps://leetcode.com/problems/range-sum-query-immutable/

Given an integer array nums, handle multiple queries of the following type:

Calculate the sum of the elements of nums between indices left and right inclusive where left <= right.

Implement the NumArray class:

NumArray(int[] nums) Initializes the object with the integer array nums.
int sumRange(int left, int right) Returns the sum of the elements of nums between indices left and right inclusive (i.e. nums[left] + nums[left + 1] + ... + nums[right]).

Example 1:

Input
["NumArray", "sumRange", "sumRange", "sumRange"]
[[[-2, 0, 3, -5, 2, -1]], [0, 2], [2, 5], [0, 5]]
Output
[null, 1, -1, -3]

Explanation
NumArray numArray = new NumArray([-2, 0, 3, -5, 2, -1]);
numArray.sumRange(0, 2); // return (-2) + 0 + 3 = 1
numArray.sumRange(2, 5); // return 3 + (-5) + 2 + (-1) = -1
numArray.sumRange(0, 5); // return (-2) + 0 + 3 + (-5) + 2 + (-1) = -3

Constraints:

1 <= nums.length <= 104
-105 <= nums[i] <= 105
0 <= left <= right < nums.length
At most 104 calls will be made to sumRange.

【C++】

class NumArray {
    vector<int> psum;
public:
    NumArray(vector<int>& nums) {
        psum = vector<int>(nums.size() + 1);
        for (int i = 0; i < nums.size(); i++) {
            psum[i+1] = psum[i] + nums[i];
        }
    }
    
    int sumRange(int left, int right) {
        return psum[right+1] - psum[left];
    }
};

/**
 * Your NumArray object will be instantiated and called as such:
 * NumArray* obj = new NumArray(nums);
 * int param_1 = obj->sumRange(left,right);
 */

【Java】

class NumArray {
    private int[] psum;
    
    public NumArray(int[] nums) {
        psum = new int[nums.length + 1];
        for (int i = 0; i < nums.length; i++) {
            psum[i+1] = psum[i] + nums[i];
        }
    }
    
    public int sumRange(int left, int right) {
        return psum[right+1] - psum[left];
    }
}

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