LeetCode 0303 - Range Sum Query - Immutable

Reck Zhang

发布于 2021-08-11 11:51:30

3120

发布于 2021-08-11 11:51:30

文章被收录于专栏：Reck Zhang

Range Sum Query - Immutable

Desicription

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.

Solution

class NumArray {
private:
    vector<int> pre;
public:
    explicit NumArray(vector<int> nums) {
        pre = vector<int>(nums.size(), 0);
        for(int i = 0; i < pre.size(); i++) {
            if(i == 0) {
                pre[i] = nums[i];
            } else {
                pre[i] = pre[i - 1] + nums[i];
            }
        }
    }

    int sumRange(int i, int j) {
        return pre[j] - (i == 0 ? 0 : pre[i - 1]);
    }
};

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

本文参与腾讯云自媒体同步曝光计划，分享自作者个人站点/博客。

原始发表：2018-12-25，如有侵权请联系 cloudcommunity@tencent.com 删除

function